In-Place Bijective Burrows-Wheeler Transforms

Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

6 Citations (Scopus)


One of the most well-known variants of the Burrows-Wheeler transform (BWT) [Burrows and Wheeler, 1994] is the bijective BWT (BBWT) [Gil and Scott, arXiv 2012], which applies the extended BWT (EBWT) [Mantaci et al., TCS 2007] to the multiset of Lyndon factors of a given text. Since the EBWT is invertible, the BBWT is a bijective transform in the sense that the inverse image of the EBWT restores this multiset of Lyndon factors such that the original text can be obtained by sorting these factors in non-increasing order. In this paper, we present algorithms constructing or inverting the BBWT in-place using quadratic time. We also present conversions from the BBWT to the BWT, or vice versa, either (a) in-place using quadratic time, or (b) in the run-length compressed setting using O(n lg r/lg lg r) time with O(r lg n) bits of words, where r is the sum of character runs in the BWT and the BBWT. 2012 ACM Subject Classification Theory of computation; Mathematics of computing ! Combinatorics on words.

Original languageEnglish
Title of host publication31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020
EditorsInge Li Gortz, Oren Weimann
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771498
Publication statusPublished - 2020 Jun 1
Event31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020 - Copenhagen, Denmark
Duration: 2020 Jun 172020 Jun 19

Publication series

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


Conference31st Annual Symposium on Combinatorial Pattern Matching, CPM 2020


  • Burrows-wheeler transform
  • In-place algorithms
  • Lyndon words


Dive into the research topics of 'In-Place Bijective Burrows-Wheeler Transforms'. Together they form a unique fingerprint.

Cite this