arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2505.04549cs.DS
收藏

带ε转移的快速模式匹配

Fast Pattern Matching with Epsilon Transitions

Nicola Cotumaccio

AI总结:

针对标记图字符串匹配问题,本文改进Wheeler广义自动机压缩表示下的线性时间求解方法,移除无ε转移的假设,仅需新增两个线性时间构建的位向量即可保持时空界,增强了方法的表达能力与适用范围。

摘要:

在标记图字符串匹配(SMLG)问题中,我们需要判断模式串是否出现在给定的标记图或给定的自动机上。在正交向量假设下,SMLG问题无法在次平方时间内求解[ICALP 2019]。在典型的生物信息学应用中,模式匹配算法需要同时具备快速和空间高效的特点,因此我们需要确定能高效求解SMLG问题的有用图类。\n 本文改进了近期的一项研究结果[STACS 2024],该结果展示了如何在Wheeler广义自动机(一类扩展了de Bruijn图的字符串标记自动机)的压缩表示上以线性时间求解SMLG问题。更确切地说,我们展示了如何在保持相同时间和空间界的前提下,移除自动机不含$ε$-转移(即标记为空串的边)的假设。这是一项重大改进,因为$ε$-转移能大幅增强表达能力(可免费跳转到多个状态),并能刻画正则表达式的复杂度(通过将正则表达式转换为等价自动机的Thompson构造法)。我们证明,为支持$ε$-转移,仅需额外存储两个可在线性时间内构建的位向量。

英文摘要:

In the String Matching in Labeled Graphs (SMLG) problem, we need to determine whether a pattern string appears on a given labeled graph or a given automaton. Under the Orthogonal Vectors hypothesis, the SMLG problem cannot be solved in subquadratic time [ICALP 2019]. In typical bioinformatics applications, pattern matching algorithms should be both fast and space-efficient, so we need to determine useful classes of graphs on which the SLMG problem can be solved efficiently. In this paper, we improve on a recent result [STACS 2024] that shows how to solve the SMLG problem in linear time on the compressed representation of Wheeler generalized automata, a class of string-labeled automata that extend de Bruijn graphs. More precisely, we show how to remove the assumption that the automata contain no $ ε$-transitions (namely, edges labeled with the empty string), while retaining the same time and space bounds. This is a significant improvement because $ ε$-transitions add considerable expressive power (making it possible to jump to multiple states for free) and capture the complexity of regular expressions (through Thompson's construction for converting a regular expression into an equivalent automaton). We prove that, to enable $ ε$-transitions, we only need to store two additional bitvectors that can be constructed in linear time.

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

↑