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

字符串集合的BWT变体综述

A survey of BWT variants for string collections

Davide Cenzato, Zsuzsanna Lipták

AI总结:

本文综述了字符串集合BWT的不同变体,识别出18种工具中的6种变体,并指出它们不等价且受输入顺序影响,在相似短序列集合上差异最大,运行次数变化可达4.2倍。

摘要:

近年来,生物信息学研究的焦点已从单个序列转向序列集合。鉴于Burrows-Wheeler变换(BWT)在字符串处理中的基础性作用,已有许多专用工具被开发用于计算字符串集合的BWT。虽然研究重点一直放在提高效率(包括空间和时间)上,但所采用的BWT的精确定义并未受到关注。正如本文所示,当前使用的不同工具往往计算出不等价的BWT变体:所得变换可能彼此差异显著,包括运行次数$r$(BWT的一个核心参数)在内。此外,对于许多工具,变换结果依赖于集合的输入顺序。换言之,在同一数据集上,如果数据集的顺序不同,同一工具可能输出不同的变换。我们研究了18个用于计算字符串集合BWT的专用工具,并识别出这些工具计算的6种不同BWT变体。我们从理论和实践两个角度回顾了这些BWT变体之间的差异,并在8个具有不同特征的真实生物数据集上进行了比较。我们发现,差异可能很大,具体取决于数据集,并且在包含许多相似短序列的集合上差异最大。参数$r$(BWT的运行次数)在不同BWT变体之间也显示出显著变化;在我们的数据集上,其变化倍数最高达4.2。用于复现结果和下载文章所用数据的源代码和脚本可在\url{https://github.com/davidecenzato/BWT-variants-for-string-collections}获取。

英文摘要:

In recent years, the focus of bioinformatics research has moved from individual sequences to collections of sequences. Given the fundamental role of the Burrows-Wheeler Transform (BWT) in string processing, a number of dedicated tools have been developed for computing the BWT of string collections. While the focus has been on improving efficiency, both in space and time, the exact definition of the BWT employed has not been at the center of attention. As we show in this paper, the different tools in use often compute non-equivalent BWT variants: the resulting transforms can differ from each other significantly, including the number $r$ of runs, a central parameter of the BWT. Moreover, with many tools, the transform depends on the input order of the collection. In other words, on the same dataset, the same tool may output different transforms if the dataset is given in a different order. We studied $18$ dedicated tools for computing the BWT of string collections and have been able to identify $6$ different BWT variants computed by these tools. We review the differences between these BWT variants, both from a theoretical and from a practical point of view, comparing them on $8$ real-life biological datasets with different characteristics. We find that the differences can be extensive, depending on the datasets, and are largest on collections of many similar short sequences. The parameter $r$, the number of runs of the BWT, also shows notable variation between the different BWT variants; on our datasets, it varied by a multiplicative factor of up to $4.2$. Source code and scripts to replicate the results and download the data used in the article are available at \url{https://github.com/davidecenzato/BWT-variants-for-string-collections}

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

↑