Search-Optimized Suffix-Tree Storage for Biological Applications

Bedathur, Srikanta; Haritsa, Jayant; Bader, David A.; Parashar, Manish; Varadarajan, Sridhar; Prasanna, Viktor K.

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Search-Optimized Suffix-Tree Storage for Biological Applications

MPS-Authors

/persons/resource/persons44104

Bedathur, Srikanta
Databases and Information Systems, MPI for Informatics, Max Planck Society;

Haritsa, Jayant
Max Planck Society;

Varadarajan, Sridhar
Max Planck Society;

External Resource

There are no locators available

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Bedathur, S., & Haritsa, J. (2006). Search-Optimized Suffix-Tree Storage for Biological Applications. In 12th IEEE International Conference on High Performance Computing (HiPC) (pp. 29-39). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-000F-23E8-A

要旨

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 sequence search 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.