Name
Abstract | ||
|---|---|---|
The suffix array, perhaps the most important data structure in modern string processing, needs to be augmented with the longest-common-prefix (LCP) array in many applications. Their construction is often a major bottleneck especially when the data is too big for internal memory. We describe two new algorithms for computing the LCP array from the suffix array in external memory. Experiments demonstrate that the new algorithms are about a factor of two faster than the fastest previous algorithm. |
Year | Venue | Field |
|---|---|---|
2016 | ESA | LCP array,Hashed array tree,Data structure,Sparse array,Computer science,Parallel computing,Suffix array,Out-of-core algorithm,Compressed suffix array,Auxiliary memory |
DocType | Citations | PageRank |
Conference | 5 | 0.43 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Juha Kärkkäinen | 1 | 1354 | 95.20 |
| Dominik Kempa | 2 | 142 | 16.37 |