Sciweavers

26 search results - page 2 / 6
» Suffix Vector: A Space-Efficient Suffix Tree Representation
Sort
View
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
JCB
2008
122views more  JCB 2008»
13 years 5 months ago
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
In this article, we propose a new method for computing rare maximal exact matches between multiple sequences. A rare match between k sequences S1; : : :; Sk is a string that occur...
Enno Ohlebusch, Stefan Kurtz
ML
2006
ACM
132views Machine Learning» more  ML 2006»
13 years 5 months ago
A suffix tree approach to anti-spam email filtering
We present an approach to email filtering based on the suffix tree data structure. A method for the scoring of emails using the suffix tree is developed and a number of scoring and...
Rajesh Pampapathi, Boris Mirkin, Mark Levene
JACM
2006
112views more  JACM 2006»
13 years 5 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...
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
13 years 9 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences. It finds many applications in practice, especiall...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong