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

关于从语言计算最小惠勒确定有限自动机

On Computing Minimum Wheeler DFA From Their Language

Ca’ Foscari University of Venice(威尼斯卡福斯卡里大学)

Ruben Becker, Davide Cenzato, Nicola Prezza, Daniel Puttini

AI总结:

研究在计算泛基因组学中,针对识别惠勒语言的自动机计算最小等效惠勒DFA的问题。提出首个算法,能在近最优、线性对数输出敏感时间内为一般DFA解决该问题,缩小差距并提升处理吞吐量,可构建最优模式匹配数据结构。

摘要:

惠勒自动机最近作为Burrows-Wheeler变换的强大推广而出现,能在压缩标记图上进行最优线性时间模式匹配,这一任务通常计算困难。当自动机识别惠勒语言时,计算其最小等效惠勒确定有限自动机(DFA)是一种强大的索引策略,在计算泛基因组学中尤为重要。然而,构建最小惠勒DFA一直是计算瓶颈。已知该问题对于非确定性输入是PSPACE难的。当输入是DFA时,现有解决方案存在妥协:要么快速但限于无环DFA,要么能处理一般拓扑但极慢。本文提出首个算法,能在近最优、线性对数输出敏感时间内为一般DFA解决该问题,缩小了差距。通过匹配无环解决方案的效率并保持完全通用性,该方法比之前的一般解决方案至少提高了二次因子。还展示了算法对实际泛基因组图的实际影响,工具在标准工作站上实现每秒超过10^5次转换的处理吞吐量,能在此类应用中构建可证明最优的模式匹配数据结构。

英文摘要:

Wheeler automata have recently emerged as a powerful generalization of the Burrows-Wheeler Transform, enabling optimal linear-time pattern matching on compressed labeled graphs -- a task that is otherwise computationally hard. Consequently, when an automaton recognizes a Wheeler language (i.e., it is equivalent to some Wheeler automaton), computing its minimum equivalent Wheeler DFA is a powerful indexing strategy. This problem is particularly relevant in computational pangenomics, where pangenome graphs frequently recognize Wheeler languages. However, constructing the minimum Wheeler DFA for a Wheeler language has remained a computational bottleneck. The problem is known to be PSPACE-hard for nondeterministic inputs. When the input is a DFA, state-of-the-art solutions forced a compromise: they were either fast but limited to acyclic DFAs (Alanko et al., SODA 2020) or capable of handling general topologies but prohibitively slow (D'Agostino et al., TCS 2023). In this work, we bridge this gap with the first algorithm solving the problem for general DFAs in near-optimal, linearithmic output-sensitive time. By matching the efficiency of acyclic-only solutions while retaining full generality, our approach improves upon the previous general solution by at least a quadratic factor. We demonstrate the practical impact of our algorithm on real-world pangenome graphs; our tool achieves a processing throughput of over 10^5 transitions per second on a standard workstation, enabling the construction of a provably optimal pattern matching data structure in such applications.

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

↑