| ID:
279183.0,
MPI für Informatik / Algorithms and Complexity Group |
| Better External Memory Suffix Array Construction |
| Authors: | Dementiev, Roman; Kärkkäinen, Juha; Mehnert, Jens; Sanders, Peter |
| Editors: | Demetrescu, Camil; Sedgewick, Robert; Tamassia, Roberto |
| Language: | English |
| Publisher: | SIAM |
| Place of Publication: | Philadelphia, USA |
| Date of Publication (YYYY-MM-DD): | 2005 |
| Title of Proceedings: | Proceedings of the Seventh Workshop on Algorithm Engineering and Experiments and the Second Workshop on Analytic Algorithmics and Combinatorics (ALENEX/ANALCO 2005) |
| Start Page: | 86 |
| End Page: | 97 |
| Place of Conference/Meeting: | Vancouver, British Columbia, Canada |
(Start) Date of Conference/Meeting
(YYYY-MM-DD): | 2005-01-22 |
| Review Status: | not specified |
| Audience: | Experts Only |
| Intended Educational Use: | No |
| Abstract / Description: | 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 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 4GByte in hours
on a low cost machine where
all previous implementations we are aware of would fail or take days.
We also present a simple and efficient external algorithm for checking
whether an array of indexes is a suffix array.
As a tool of possible independent interest we present a systematic way
to design, analyze, and implement \emph{pipelined}
algorithms. |
| Last Change of the Resource (YYYY-MM-DD): | 2006-06-16 |
| External Publication Status: | published |
| Document Type: | Conference-Paper |
| Communicated by: | Kurt Mehlhorn |
| Affiliations: | MPI für Informatik/Algorithms and Complexity Group
|
| Identifiers: | ISBN:0-89871-596-2
LOCALID:C1256428004B93B8-3A3C24F177ACF9B2C1256FAC0057E187-... |
| Full Text: |
| You have privileges to view the following file(s): |
| DKMS05.pdf [231,00 Kb] [Comment:file from upload service] |
|
| |
|
Advanced
