Computing the Parameterized Burrows–Wheeler Transform Online

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

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


Parameterized strings are a generalization of strings in that their characters are drawn from two different alphabets, where one is considered to be the alphabet of static characters and the other to be the alphabet of parameter characters. Two parameterized strings are a parameterized match if there is a bijection over all characters such that the bijection transforms one string to the other while keeping the static characters (i.e., it behaves as the identity on the static alphabet). Ganguly et al. [SODA 2017] proposed the parameterized Burrows–Wheeler transform (pBWT) as a variant of the Burrows–Wheeler transform for space-efficient parameterized pattern matching. In this paper, we propose an algorithm for computing the pBWT online by reading the characters of a given input string one-by-one from right to left. Our algorithm works in O(| Π| log n/ log log n) amortized time for each input character, where n and Π denote the size of the input string and the alphabet of the parameter characters, respectively.

Original languageEnglish
Title of host publicationString Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings
EditorsDiego Arroyuelo, Diego Arroyuelo, Barbara Poblete
PublisherSpringer Science and Business Media Deutschland GmbH
Number of pages16
ISBN (Print)9783031206429
Publication statusPublished - 2022
Event29th International Symposium on String Processing and Information Retrieval, SPIRE 2022 - Concepción, Chile
Duration: 2022 Nov 82022 Nov 10

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13617 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference29th International Symposium on String Processing and Information Retrieval, SPIRE 2022


  • Burrows–Wheeler transform
  • Online algorithm
  • Parameterized string

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Computing the Parameterized Burrows–Wheeler Transform Online'. Together they form a unique fingerprint.

Cite this