Indexing the bijective BWT

Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piątkowski

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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.

Original languageEnglish
Title of host publication30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
EditorsNadia Pisanti, Solon P. Pissis
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771030
DOIs
Publication statusPublished - Jun 1 2019
Event30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 - Pisa, Italy
Duration: Jun 18 2019Jun 20 2019

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume128
ISSN (Print)1868-8969

Conference

Conference30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019
CountryItaly
CityPisa
Period6/18/196/20/19

Fingerprint

Data compression

All Science Journal Classification (ASJC) codes

  • Software

Cite this

Bannai, H., Kärkkäinen, J., Köppl, D., & Piątkowski, M. (2019). Indexing the bijective BWT. In N. Pisanti, & S. P. Pissis (Eds.), 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019 [17] (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 128). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.CPM.2019.17

Indexing the bijective BWT. / Bannai, Hideo; Kärkkäinen, Juha; Köppl, Dominik; Piątkowski, Marcin.

30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. ed. / Nadia Pisanti; Solon P. Pissis. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. 17 (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 128).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bannai, H, Kärkkäinen, J, Köppl, D & Piątkowski, M 2019, Indexing the bijective BWT. in N Pisanti & SP Pissis (eds), 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019., 17, Leibniz International Proceedings in Informatics, LIPIcs, vol. 128, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, Pisa, Italy, 6/18/19. https://doi.org/10.4230/LIPIcs.CPM.2019.17
Bannai H, Kärkkäinen J, Köppl D, Piątkowski M. Indexing the bijective BWT. In Pisanti N, Pissis SP, editors, 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2019. 17. (Leibniz International Proceedings in Informatics, LIPIcs). https://doi.org/10.4230/LIPIcs.CPM.2019.17
Bannai, Hideo ; Kärkkäinen, Juha ; Köppl, Dominik ; Piątkowski, Marcin. / Indexing the bijective BWT. 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019. editor / Nadia Pisanti ; Solon P. Pissis. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2019. (Leibniz International Proceedings in Informatics, LIPIcs).
@inproceedings{c5a27bdc78d942058c42b27b858df4d5,
title = "Indexing the bijective BWT",
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.",
author = "Hideo Bannai and Juha K{\"a}rkk{\"a}inen and Dominik K{\"o}ppl and Marcin Piątkowski",
year = "2019",
month = "6",
day = "1",
doi = "10.4230/LIPIcs.CPM.2019.17",
language = "English",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",
editor = "Nadia Pisanti and Pissis, {Solon P.}",
booktitle = "30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019",

}

TY - GEN

T1 - Indexing the bijective BWT

AU - Bannai, Hideo

AU - Kärkkäinen, Juha

AU - Köppl, Dominik

AU - Piątkowski, Marcin

PY - 2019/6/1

Y1 - 2019/6/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85068044348&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85068044348&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.CPM.2019.17

DO - 10.4230/LIPIcs.CPM.2019.17

M3 - Conference contribution

T3 - Leibniz International Proceedings in Informatics, LIPIcs

BT - 30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019

A2 - Pisanti, Nadia

A2 - Pissis, Solon P.

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -