773 search results - page 2 / 155 » Suffix Trees on Words |
JCB
2008
13 years 5 months ago
2008
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...
ACSC
2001
IEEE
13 years 9 months ago
2001
IEEE
This paper analyses the efficiency of different data structures for detecting overlap in digital documents. Most existing approaches use some hash function to reduce the space req...
TCS
2008
13 years 5 months ago
2008
A suffix vector of a string is an index data structure equivalent to a suffix tree. It was first introduced by Monostori et al. in 2001 [9, 10, 11]. They proposed a linear constru...
ICML
2002
IEEE
14 years 6 months ago
2002
IEEE
RECOMB
2009
Springer
14 years 5 months ago
2009
Springer
A repetitive sequence collection is one where portions of a base sequence of length n are repeated many times with small variations, forming a collection of total length N. Example...