75 search results - page 1 / 15 » Optimal Suffix Tree Construction with Large Alphabets |
FOCS
1997
IEEE
13 years 9 months ago
1997
IEEE
SODA
1990
ACM
13 years 5 months ago
1990
ACM
A new and conceptually simple data structure, called a suffix array, for on-line string searches is introduced in this paper. Constructing and querying suffix arrays is reduced to...
ICALP
2007
Springer
13 years 8 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...
IJFCS
2006
13 years 4 months ago
2006
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a su...
ALGORITHMICA
1999
13 years 4 months ago
1999
We discuss an intrinsic generalization of the suffix tree, designed to index a string of length n which has a natural partitioning into m multicharacter substrings or words. This ...