Better external memory suffix array construction (2005)
| Venue: | In: Workshop on Algorithm Engineering & Experiments |
| Citations: | 24 - 5 self |
BibTeX
@INPROCEEDINGS{Dementiev05betterexternal,
author = {Roman Dementiev and Juha Kärkkäinen and Jens Mehnert and Peter Sanders},
title = {Better external memory suffix array construction},
booktitle = {In: Workshop on Algorithm Engineering & Experiments},
year = {2005}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Suffix arrays are a simple and powerful data structure for text processing that can be used for full text indexes, data compression, and many other applications in particular in bioinformatics. However, so far it has looked prohibitive to build suffix arrays for huge inputs that do not fit into main memory. This paper presents design, analysis, implementation, and experimental evaluation of several new and improved algorithms for suffix array construction. The algorithms are asymptotically optimal in the worst case or on the average. Our implementation can construct suffix arrays for inputs of up to 4GBytes in hours on a low cost machine. As a tool of possible independent interest we present a systematic way to design, analyze, and implement pipelined algorithms.
