Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets

Joong Chae Na. Linear-Time Construction of Compressed Suffix Arrays Using o(n log n)-Bit Working Space for Large Alphabets. In Alberto Apostolico, Maxime Crochemore, Kunsoo Park, editors, Combinatorial Pattern Matching, 16th Annual Symposium, CPM 2005, Jeju Island, Korea, June 19-22, 2005, Proceedings. Volume 3537 of Lecture Notes in Computer Science, pages 57-67, Springer, 2005. [doi]

Abstract

Abstract is missing.