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

2 Citations (Scopus)

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

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint Dive into the research topics of 'Indexing the bijective BWT'. Together they form a unique fingerprint.

Cite this