arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.13461cs.DS
收藏

在运行长度压缩的PBWT中的最优时间映射

Optimal-Time Mapping in Run-Length Compressed PBWT

Department of Computer Science, University of Milano-Bicocca(米兰比可卡大学计算机系)

Paola Bonizzoni, Davide Cozzi, Younan Gao

AI总结:

本文提出了一种基于多等位PBWT的高效数据结构,实现前向和后向步进的常数时间操作,并改进了等位基因检索和前缀搜索的效率。

摘要:

位置伯鲁瓦-威勒变换(PBWT)是一种用于高效表示和查询大规模序列集合的数据结构,例如基因组学中的等位基因面板。前向和后向步进操作——类似于传统BWT中的LF-和FL-映射——是PBWT的基础,支撑了许多基于PBWT的等位基因匹配及相关分析算法。尽管运行长度编码的PBWT变种(也称为$μ$-PBWT)实现了$O(\newR)$-字节的空间使用,其中$\newR$是总运行数,但此前没有已知的数据结构能够在该空间限制内以常数时间支持前向和后向步进。在本文中,我们考虑了从其原始二进制形式扩展到一般有序字母表$\{0, \dots, σ-1\}$的多等位PBWT。我们首先建立了$\newR$的大小界限,然后介绍了一个基于等位基因列表$\{S_1, \dots, S_\height\}$的新$O(\newR)$-字节数据结构,每个等位基因的长度为$\width$,该结构支持常数时间的前向和后向步进。我们进一步回顾了两个关键应用——等位基因检索和前缀搜索——利用我们的高效前向步进技术。具体来说,我们设计了一个$O(\newR)$-字节空间的数据结构,支持在$O(\log \log_{\word} h + \width)$时间内进行等位基因检索。对于前缀搜索,我们提出了一个$O(\height + \newR)$-字节的数据结构,能够以$O(m' \log\log_{\word} σ+ \occ)$的时间回答查询,其中$m'$表示返回的最长公共前缀长度,$\occ$表示前缀最长前缀的等位基因数量。

英文摘要:

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 $μ$-PBWT) achieves $O(\newR)$-word space usage, where $\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, σ-1\}$. We first establish bounds on the size $\newR$ and then introduce a new $O(\newR)$-word data structure built over a list of haplotypes $\{S_1, \dots, S_\height\}$, each of length $\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(\newR)$-word space data structure that supports haplotype retrieval in $O(\log \log_{\word} h + \width)$ time. For prefix search, we present an $O(\height + \newR)$-word data structure that answers queries in $O(m' \log\log_{\word} σ+ \occ)$ time, where $m'$ denotes the length of the longest common prefix returned and $\occ$ denotes the number of haplotypes prefixed the longest prefix.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑