Paper Info
Title
Search-Optimized suffix-tree storage for biological applications
Abstract
Suffix-trees are popular indexing structures for various sequence processing problems in biological data management. We investigate here the possibility of enhancing the search efficiency of disk-resident suffix-trees through customized layouts of tree-nodes to disk-pages. Specifically, we propose a new layout strategy, called Stellar, that provides significantly improved search performance on a representative set of real genomic sequences. Further, Stellar supports both the standard root-to-leaf lookup queries as well as sophisticated sequencesearch algorithms that exploit the suffix-links of suffix-trees. Our results are encouraging with regard to the ultimate objective of seamlessly integrating sequence processing in database engines.
Year
DOI
Venue
2005
10.1007/11602569_8
HiPC
Keywords
Field
DocType
disk-resident suffix-trees,improved search performance,database engine,biological data management,sequence processing,search efficiency,real genomic sequence,new layout strategy,biological application,customized layout,various sequence processing problem,search-optimized suffix-tree storage,search algorithm,biological data,genome sequence
Data mining,Biological data,Search algorithm,Computer science,Search engine indexing,Exploit,Supercomputer Education Research Centre,Suffix tree,Personalization,Search tree
Conference
Volume
ISSN
ISBN
3769
0302-9743
3-540-30936-5
Citations 
PageRank 
References 
8
0.60
16
Authors
2
Name
Order
Citations
PageRank
Srikanta Bedathur160743.23
Jayant R. Haritsa22004228.38