3928 search results - page 2 / 786 » Optimal suffix selection |
ICALP
2007
Springer
13 years 9 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...
CPM
2009
Springer
13 years 3 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...
NIPS
2004
13 years 6 months ago
2004
Prediction suffix trees (PST) provide a popular and effective tool for tasks such as compression, classification, and language modeling. In this paper we take a decision theoretic...
IPL
2008
13 years 5 months ago
2008
Abstract. In this paper, we study a restricted version of the position restricted pattern matching problem introduced and studied M
FOCS
1997
IEEE
13 years 9 months ago
1997
IEEE