18 search results - page 1 / 4 » Counting Suffix Arrays and Strings |
SPIRE
2005
Springer
13 years 10 months ago
2005
Springer
SODA
1990
ACM
13 years 5 months ago
1990
ACM
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...
IJFCS
2006
13 years 4 months ago
2006
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...
ICML
2006
IEEE
14 years 5 months ago
2006
IEEE
String kernels which compare the set of all common substrings between two given strings have recently been proposed by Vishwanathan & Smola (2004). Surprisingly, these kernels...
JACM
2006
13 years 4 months ago
2006
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...