140 search results - page 6 / 28 » Practical Suffix Tree Construction |
164
click to vote
IJFCS
2008
15 years 5 months ago
2008
We present a data structure to index a specific kind of factors, that is of substrings, called gapped-factors. A gapped-factor is a factor containing a gap that is ignored during ...
170
click to vote
RECOMB
2009
Springer
16 years 6 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...
153
click to vote
CIKM
2005
Springer
15 years 11 months ago
2005
Springer
We study suitable indexing techniques to support efficient exact match search in large biological sequence databases. We propose a suffix tree (ST) representation, called STA-DF, ...
252
click to vote
ICDE
2004
IEEE
16 years 7 months ago
2004
IEEE
The indexing technique commonly used for long strings, such as genomes, is the suffix tree, which is based on a vertical (intra-path) compaction of the underlying trie structure. ...
147
click to vote
ACL
1998
15 years 7 months ago
1998
This paper describes novel and practical Japanese parsers that uses decision trees. First, we construct a single decision tree to estimate modification probabilities; how one phra...