Sciweavers

50 search results - page 1 / 10
» Enhancing Graph Database Indexing by Suffix Tree Structure
Sort
View
PRIB
2010
Springer
153views Bioinformatics» more  PRIB 2010»
13 years 2 months ago
Enhancing Graph Database Indexing by Suffix Tree Structure
Vincenzo Bonnici, Alfredo Ferro, Rosalba Giugno, A...
VLDB
2002
ACM
184views Database» more  VLDB 2002»
14 years 4 months ago
Database indexing for large DNA and protein sequence collections
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
Ela Hunt, Malcolm P. Atkinson, Robert W. Irving
EDBT
2010
ACM
155views Database» more  EDBT 2010»
13 years 8 months ago
Suffix tree construction algorithms on modern hardware
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
Dimitris Tsirogiannis, Nick Koudas
ICDE
2007
IEEE
190views Database» more  ICDE 2007»
13 years 8 months ago
CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences
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...
Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong
CPM
2006
Springer
125views Combinatorics» more  CPM 2006»
13 years 8 months ago
Geometric Suffix Tree: A New Index Structure for Protein 3-D Structures
Abstract. Protein structure analysis is one of the most important research issues in the post-genomic era, and faster and more accurate query data structures for such 3-D structure...
Tetsuo Shibuya