Results 11 to 20 of about 6,253 (207)
On updating suffix tree labels [PDF]
Theoretical Computer Science, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
FERRAGINA, PAOLO +2 more
openaire +4 more sources
The suffix tree of a tree and minimizing sequential transducers [PDF]
Theoretical Computer Science, 1995 This paper gives a linear-time algorithm for the construction of the<br />suffix tree of a tree. The suffix tree of a tree is used to obtain an efficient<br />algorithm for the minimization of sequential transducers.
Breslauer, Dany
core +6 more sources
Faster suffix tree construction with missing suffix links [PDF]
Proceedings of the thirty-second annual ACM symposium on Theory of computing, 2000 Summary: We consider suffix tree construction for situations with missing suffix links. Two examples of such situations are suffix trees for parameterized strings and suffix trees for two-dimensional arrays. These trees also have the property that the node degrees may be large.
Cole, Richard, Hariharan, Ramesh
core +7 more sources
Practical Compressed Suffix Trees [PDF]
Algorithms, 2013 The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for
Gonzalo Navarro +2 more
doaj +3 more sources
Converting suffix trees into factor/suffix oracles [PDF]
Journal of Discrete Algorithms, 2008 Several methods to compress suffix trees were defined, most of them with the aim of obtaining compact (that is, space economical) index structures. Besides this practical aspect, a compression method can reveal structural properties of the resulting data structure, allowing a better understanding of it and a better estimation of its performances.
Rusu, Irena
openaire +4 more sources
The Computer Journal, 2017 Accepted to The Computer Journal.
Andrea Farruggia +4 more
openaire +5 more sources
On Suffix Extensions in Suffix Trees
Theoretical Computer Science, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Breslauer D, Italiano G
openaire +6 more sources
IEEE Access, 2020 In order to achieve content-based binocular stereoscopic image or video retrieval efficiently, a feature indexing algorithm based on hybrid grid multiple suffix tree and hierarchical clustering is proposed.
Fengfeng Duan, Qicong Zhang
doaj +1 more source
Costruzione space efficient di un suffix tree troncato con codifica TruST [PDF]
, 2022 Argomento della tesi è il suffix tree troncato, che ha la struttura ad albero ma occupa meno spazio del suffix tree. Il procedimento originariamente usato nella costruzione del suffix tree troncato con codifica TruST si basa sulla codifica derivata da ...
Pelizzari, Gabriele
core
Analysis of the multiplicity matching parameter in suffix trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 In a suffix tree, the multiplicity matching parameter (MMP) $M_n$ is the number of leaves in the subtree rooted at the branching point of the $(n+1)$st insertion.
Mark Daniel Ward, Wojciech Szpankowski
doaj +1 more source