Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2019.17
URN: urn:nbn:de:0030-drops-104887
URL: https://drops.dagstuhl.de/opus/volltexte/2019/10488/
Bannai, Hideo ; Kärkkäinen, Juha ; Köppl, Dominik ; Piatkowski, Marcin
Indexing the Bijective BWT
| pdf-format: |
|
Abstract
The Burrows-Wheeler transform (BWT) is a permutation whose applications are prevalent in data compression and text indexing. The bijective BWT is a bijective variant of it that has not yet been studied for text indexing applications. We fill this gap by proposing a self-index built on the bijective BWT . The self-index applies the backward search technique of the FM-index to find a pattern P with O(|P| lg|P|) backward search steps.
BibTeX - Entry
@InProceedings{bannai_et_al:LIPIcs:2019:10488,
author = {Hideo Bannai and Juha K{\"a}rkk{\"a}inen and Dominik K{\"o}ppl and Marcin Piatkowski},
title = {{Indexing the Bijective BWT}},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)},
pages = {17:1--17:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-103-0},
ISSN = {1868-8969},
year = {2019},
volume = {128},
editor = {Nadia Pisanti and Solon P. Pissis},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10488},
URN = {urn:nbn:de:0030-drops-104887},
doi = {10.4230/LIPIcs.CPM.2019.17},
annote = {Keywords: Burrows-Wheeler Transform, Lyndon words, Text Indexing}
}
| Keywords: | Burrows-Wheeler Transform, Lyndon words, Text Indexing | |
| Seminar: | 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 06.06.2019 |
