Sciweavers

158 search results - page 1 / 32
» Reconstructing a Suffix Array
Sort
View
IJFCS
2006
108views more  IJFCS 2006»
13 years 4 months ago
Reconstructing a Suffix Array
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...
Frantisek Franek, William F. Smyth
SODA
1990
ACM
173views Algorithms» more  SODA 1990»
13 years 6 months ago
Suffix Arrays: A New Method for On-Line String Searches
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...
Udi Manber, Gene Myers
JEA
2008
120views more  JEA 2008»
13 years 4 months ago
Better external memory suffix array construction
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in b...
Roman Dementiev, Juha Kärkkäinen, Jens M...
SIGMOD
2008
ACM
124views Database» more  SIGMOD 2008»
14 years 4 months ago
Improving suffix array locality for fast pattern matching on disk
Ranjan Sinha, Simon J. Puglisi, Alistair Moffat, A...
JACM
2006
112views more  JACM 2006»
13 years 4 months ago
Linear work suffix array construction
Suffix trees and suffix arrays are widely used and largely interchangeable index structures on strings and sequences. Practitioners prefer suffix arrays due to their simplicity an...
Juha Kärkkäinen, Peter Sanders, Stefan B...