166 search results - page 1 / 34 » Suffix trees for very large genomic sequences |
102
Voted
CIKM
2009
Springer
15 years 5 months ago
2009
Springer
A suffix tree is a fundamental data structure for string searching algorithms. Unfortunately, when it comes to the use of suffix trees in real-life applications, the current metho...
130
Voted
ICDE
2007
IEEE
15 years 5 months ago
2007
IEEE
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...
114
Voted
JCB
2008
15 years 1 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...
192
Voted
ICDE
2004
IEEE
16 years 2 months ago
2004
IEEE
Online persistent suffix tree construction has been considered impractical due to its excessive I/O costs. However, these prior studies have not taken into account the effects of ...
114
Voted
RECOMB
2009
Springer
16 years 1 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...