Computing the Parameterized Burrows–Wheeler Transform Online

06/30/2022
by   Daiki Hashimoto, et al.
0

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 / loglog n) amortized time for each input character, where n, Σ, and Π denote the size of the input string, and the alphabets of the static and parameter characters, respectively.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/03/2018

Right-to-left online construction of parameterized position heaps

Two strings of equal length are said to parameterized match if there is ...
research
06/19/2023

Efficient Parameterized Pattern Matching in Sublinear Space

The parameterized matching problem is a variant of string matching, whic...
research
04/05/2023

Fast computation of approximate weak common intervals in multiple indeterminate strings

In ongoing work to define a principled method for syntenic block discove...
research
08/11/2023

Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching

A parameterized string (p-string) is a string over an alphabet (Σ_s∪Σ_p)...
research
08/12/2019

LSTM vs. GRU vs. Bidirectional RNN for script generation

Scripts are an important part of any TV series. They narrate movements, ...
research
08/18/2023

Wheeler maps

Motivated by challenges in pangenomic read alignment, we propose a gener...
research
10/31/2017

Replace or Retrieve Keywords In Documents at Scale

In this paper we introduce, the FlashText algorithm for replacing keywor...

Please sign up or login with your details

Forgot password? Click here to reset