Optimal-Time Mapping in Run-Length Compressed PBWT

The Positional Burrows–Wheeler Transform (PBWT) is a data structure designed for efficiently representing and querying large collections of sequences, such as haplotype panels in genomics. Forward and backward stepping operations – analogues to LF- and FL-mapping in the traditional BWT – are fundamental to the PBWT, underpinning many algorithms based on the PBWT for haplotype matching and related analyses. Although the run-length encoded variant of the PBWT (also known as the $\mu$-PBWT) achieves $O(\text{newR})$-word space usage, where $\text{newR}$ is the total number of runs, no data structure supporting both forward and backward stepping in constant time within this space bound was previously known. In this paper, we consider the multi-allelic PBWT that is extended from its original binary form to a general ordered alphabet $\{0,\dots ,\sigma -1\}$. We first establish bounds on the size $\text{newR}$ and then introduce a new $O(\text{newR})$-word data structure built over a list of haplotypes $\{S_1,\dots ,S_{\text{height}}\}$, each of length $\text{width}$, that supports constant-time forward and backward stepping. We further revisit two key applications – haplotype retrieval and prefix search – leveraging our efficient forward stepping technique. Specifically, we design an $O(\text{newR})$-word space data structure that supports haplotype retrieval in $O(\log {\log }_{\text{word}}h+\text{width})$ time. For prefix search, we present an $O(\text{height}+\text{newR})$-word data structure that answers queries in $O(m^{\mathrm{\prime }}\log {\log }_{\text{word}}\sigma +\text{occ})$ time, where $m^{\mathrm{\prime }}$ denotes the length of the longest common prefix returned and $\text{occ}$ denotes the number of haplotypes prefixed the longest prefix.