140 search results - page 5 / 28 » Practical Suffix Tree Construction |
FOCS
1997
IEEE
14 years 7 days ago
1997
IEEE
CPM
2009
Springer
13 years 5 months ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
ICALP
2007
Springer
13 years 12 months ago
2007
Springer
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
ICMCS
2009
IEEE
13 years 5 months ago
2009
IEEE
This paper presents an efficient way to construct the self-similarity matrix, a popular approach, to detect repeating segments in music. Our proposed method extends the sparse suf...
DCC
2004
IEEE
14 years 7 months ago
2004
IEEE
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...