Skip to content
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Menu
Home
About Us
Resources
Profiles Metrics
Authors Directory
Institutions Directory
Top Authors
Top Institutions
Top Sponsors
AI Digest
Contact Us
Publication Details
AFRICAN RESEARCH NEXUS
SHINING A SPOTLIGHT ON AFRICAN RESEARCH
computer science
Replacing suffix trees with enhanced suffix arrays
Journal of Discrete Algorithms, Volume 2, No. 1 SPEC. ISS., Year 2004
Notification
URL copied to clipboard!
Description
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. © 2003 Elsevier B.V. All rights reserved.
Authors & Co-Authors
Abouelhoda, Mohamed Ibrahim
Germany, Ulm
Universität Ulm
Kurtz, Stefan
Germany, Hamburg
Universität Hamburg
Ohlebusch, Enno
Germany, Ulm
Universität Ulm
Statistics
Citations: 524
Authors: 3
Affiliations: 2
Identifiers
Doi:
10.1016/S1570-8667(03)00065-0
ISSN:
15708667
Research Areas
Cancer
Genetics And Genomics