Results 51 to 60 of about 58,956 (207)
40 years of suffix trees [PDF]
Communications of the ACM, 2016 Tracing the first four decades in the life of suffix trees, their many incarnations, and their applications.
Alberto Apostolico +4 more
openaire +3 more sources
, 2013 This paper presents a general technique for optimally transforming any dynamic data structure that operates on atomic and indivisible keys by constant-time comparisons, into a data structure that handles unbounded-length keys whose comparison cost is not
Amir, Amihood +5 more
core +1 more source
Compressed property suffix trees
Information and Computation, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wing-Kai Hon +3 more
openaire +2 more sources
BuST-Bundled Suffix Trees [PDF]
, 2006 We introduce a data structure, the Bundled Suffix Tree (BUST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a non-transitive relation ≈ among its letters. Following the path of a substring β within a BUST, constructed over a text α of length n, not only the positions of the exact occurrences of β in
Luca Bortolussi +2 more
openaire +2 more sources
Agile Prediction of Ongoing Temporal Sequences Based on Dominative Random Subsequences [PDF]
International Journal of Computational Intelligence Systems, 2013 This paper identifies a new paradigm of prediction, of ongoing temporal sequences, which achieves an acceptable accuracy just by the historical subsequences as short as possible and as close to the predicted time point as possible.
Ning Yang, Changjie Tang
doaj +1 more source
A New Strategy to Design Reconfigurable Rivest–Shamir–Adleman (RSA) Accelerators
International Journal of Circuit Theory and Applications, EarlyView.A reconfigurable FPGA‐based RSA accelerator is proposed using compression‐based modular multipliers combined with pseudomoduli arithmetic. The approach maps modular exponentiation to low‐cost arithmetic domains and applies a correction stage, achieving significant improvements in delay, operating frequency, and delay–area efficiency compared with ...
Augusto C. B. Vassoler +4 more
wiley +1 more source
Local Similarity Search to Find Gene Indicators in Mitochondrial Genomes
Biology, 2014 Given a set of nucleotide sequences we consider the problem of identifying conserved substrings occurring in homologous genes in a large number of sequences.
Ruby L. V. Moritz +2 more
doaj +1 more source
Two Serbian place names ending in -iš of Romanian origin - Mriš and Dešiška [PDF]
Balcanica, 2007 The suffix -iş is among the most productive in Romanian toponymy, and is mostly used for deriving drymonyms (names of forests) with the name of a tree as their usual derivational stem.
Loma Aleksandar
doaj +1 more source
Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array
, 2016 The longest common prefix (LCP) array is a versatile auxiliary data structure in indexed string matching. It can be used to speed up searching using the suffix array (SA) and provides an implicit representation of the topology of an underlying suffix ...
D Okanohara +20 more
core +1 more source
Robust β‐myrcene block copolymer elastomeric vitrimers
Polymer International, EarlyView.Myrcene‐based vitrimeric elastomers were compared: statistical (poly(styrene‐stat‐myrcene‐stat‐AAEMA)] versus ‘hard–soft’ diblock (poly(styrene)‐block‐poly(myrcene‐co‐AAEMA)). The diblock's ability to anchor the glassy poly(styrene) blocks in a self‐assembled microstructure was effective – leading to four times higher tensile stress and ten times ...
Chong Yang Du +2 more
wiley +1 more source