We introduce the problem of computing the Burrows- Wheeler Transform (BWT) using just O(1) additional space. Our in-place algorithm does not need the explicit storage for the suffix sort array and the output array, as typically required in previous work. It relies on the combinatorial properties of the BWT, and runs in O(n2) time in the comparison model using O(1) extra memory cells, apart from the array of n cells storing the n characters of the input text. We also discuss some time-space trade-offs for the inverse algorithm to obtain the text from the given BWT. \ 2013 Springer-Verlag.
|Title of host publication||Combinatorial Pattern Matching - 24th Annual Symposium, CPM 2013, Proceedings|
|Number of pages||9|
|State||Published - 2013|
|Event||24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013 - Bad Herrenalb, Germany|
Duration: 17 Jun 2013 → 19 Jun 2013
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||24th Annual Symposium on Combinatorial Pattern Matching, CPM 2013|
|Period||17/06/13 → 19/06/13|
Bibliographical noteFunding Information:
The work of the third author has been supported by the Academy of Finland grant 118653 (ALGODAN). The work of the fourth author has been partially supported by the National Science Foundation Award 0904246, Israel Science Foundation grant 347/09, Yahoo, Grant No. 2008217 from the United States-Israel Binational Science Foundation (BSF) and DFG.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)