23 search results - page 3 / 5 » PSIST: Indexing Protein Structures Using Suffix Trees |
105
click to vote
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
108
click to vote
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...
104
click to vote
CPM
2007
Springer
15 years 5 months ago
2007
Springer
This paper considers enumeration of substring equivalence classes introduced by Blumer et al. [1]. They used the equivalence classes to define an index structure called compact dir...
195
click to vote
ICDE
2004
IEEE
16 years 3 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. ...
120
click to vote
RECOMB
2009
Springer
16 years 2 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...