Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda. Computing the Burrows-Wheeler Transform of a String and Its Reverse. In Juha Kärkkäinen, Jens Stoye, editors, Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings. Volume 7354 of Lecture Notes in Computer Science, pages 243-256, Springer, 2012. [doi]
@inproceedings{OhlebuschBA12,
title = {Computing the Burrows-Wheeler Transform of a String and Its Reverse},
author = {Enno Ohlebusch and Timo Beller and Mohamed Ibrahim Abouelhoda},
year = {2012},
doi = {10.1007/978-3-642-31265-6_20},
url = {http://dx.doi.org/10.1007/978-3-642-31265-6_20},
researchr = {https://researchr.org/publication/OhlebuschBA12},
cites = {0},
citedby = {0},
pages = {243-256},
booktitle = {Combinatorial Pattern Matching - 23rd Annual Symposium, CPM 2012, Helsinki, Finland, July 3-5, 2012. Proceedings},
editor = {Juha Kärkkäinen and Jens Stoye},
volume = {7354},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-31264-9},
}