Sciweavers

56 search results - page 1 / 12
» Practical Compressed Suffix Trees
Sort
View
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
13 years 7 months ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda
WEA
2010
Springer
205views Algorithms» more  WEA 2010»
13 years 1 months ago
Practical Compressed Suffix Trees
Abstract. The suffix tree is an extremely important data structure for stringology, with a wealth of applications in bioinformatics. Classical implementations require much space, w...
Rodrigo Cánovas, Gonzalo Navarro
IJFCS
2006
108views more  IJFCS 2006»
13 years 3 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 4 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