Replacing suffix trees with enhanced suffix arrays

The suffix tree is one of the most important data structures in string processing and comparative genomics. However, the space consumption of the suffix tree is a bottleneck in large scale applications such as genome analysis. In this article, we will overcome this obstacle. We will show how every a...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of discrete algorithms (Amsterdam, Netherlands) Ročník 2; číslo 1; s. 53 - 86
Hlavní autoři: Abouelhoda, Mohamed Ibrahim, Kurtz, Stefan, Ohlebusch, Enno
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 2004
Témata:
Genome comparison
Pattern matching
Repeat analysis
Suffix array
Suffix tree
Suffix tree
Suffix array
Genome comparison
Pattern matching
Repeat analysis
ISSN:1570-8667, 1570-8675
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:The suffix tree is one of the most important data structures in string processing and comparative genomics. However, the space consumption of the suffix tree is a bottleneck in large scale applications such as genome analysis. In this article, we will overcome this obstacle. We will show how every algorithm that uses a suffix tree as data structure can systematically be replaced with an algorithm that uses an enhanced suffix array and solves the same problem in the same time complexity. The generic name enhanced suffix array stands for data structures consisting of the suffix array and additional tables. Our new algorithms are not only more space efficient than previous ones, but they are also faster and easier to implement.
ISSN:1570-8667
1570-8675
DOI:10.1016/S1570-8667(03)00065-0