223 search results - page 5 / 45 » Suffix Arrays on Words |
IPL
2008
14 years 11 months ago
2008
We give two optimal linear-time algorithms for computing the Longest Previous Factor (LPF) array corresponding to a string w. For any position i in w, LPF[i] gives the length of th...
CPM
2009
Springer
15 years 2 months ago
2009
Springer
In this paper we present in detail a new efficient linear time and space suffix array construction algorithm(SACA), called the D-CriticalSubstring algorithm. The algorithm is built...
173
click to vote
ICDE
2004
IEEE
16 years 27 days ago
2004
IEEE
Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of ...
113
click to vote
ICALP
2007
Springer
15 years 3 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...
110
click to vote
FOCS
2009
IEEE
15 years 3 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...