Name
Abstract | ||
|---|---|---|
We describe an external memory suffix array construction algorithm based on constructing suffix arrays for blocks of text and merging them into the full suffix array. The basic idea goes back over 20 years and there has been a couple of later improvements, but we describe several further improvements that make the algorithm much faster. In particular, we reduce the I/O volume of the algorithm by a factor (mathcal {O}!left( {log _sigma n} right) ). Our experiments show that the algorithm is the fastest suffix array construction algorithm when the size of the text is within a factor of about five from the size of the RAM in either direction, which is a common situation in practice. |
Year | DOI | Venue |
|---|---|---|
2017 | 10.1007/s11786-016-0281-1 | Mathematics in Computer Science |
Keywords | DocType | Volume |
Suffix array construction, External memory algorithms, Algorithm engineering, 68W32 (Algorithms on strings) | Journal | 11 |
Issue | ISSN | Citations |
2 | 1661-8289 | 4 |
PageRank | References | Authors |
0.40 | 19 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juha Kärkkäinen | 1 | 1354 | 95.20 |
| Dominik Kempa | 2 | 142 | 16.37 |