Fast algorithms for sorting and searching strings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On the Performance of BWT Sorting Algorithms
DCC '00 Proceedings of the Conference on Data Compression
An Efficient Method for in Memory Construction of Suffix Arrays
SPIRE '99 Proceedings of the String Processing and Information Retrieval Symposium & International Workshop on Groupware
ACM Computing Surveys (CSUR)
A taxonomy of suffix array construction algorithms
ACM Computing Surveys (CSUR)
An efficient, versatile approach to suffix sorting
Journal of Experimental Algorithmics (JEA)
Fast BWT in small space by blockwise suffix sorting
Theoretical Computer Science
Fast and Practical Algorithms for Computing All the Runs in a String
CPM '07 Proceedings of the 18th annual symposium on Combinatorial Pattern Matching
Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
ISAAC '08 Proceedings of the 19th International Symposium on Algorithms and Computation
Fast lightweight suffix array construction and checking
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
Lightweight Data Indexing and Compression in External Memory
Algorithmica - Special Issue: Theoretical Informatics
| Hi-index | 0.89 |
Suffix array (SA) construction is a time-and-memory bottleneck in many string processing applications. In this paper we improve the runtime of a small-space - semi-external - SA construction algorithm by Karkkainen (TCS, 2007) [5]. We achieve a speedup in practice of 2-4 times, without increasing memory usage. Our main contribution is a way to implement the ''pointer copying'' heuristic, used in less space-efficient SA construction algorithms, in a memory-efficient way.