关于带有通配符和k-错误的极大连环结构的时间-空间折中
On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and $k$-Mismatches
AI总结:
本文提出了一种线性空间算法,用于处理包含通配符的文本中的极大连环结构,并在特定参数范围内改进了时间-空间乘积。同时,该方法扩展到k-错误设置,支持或不支持通配符。
摘要:
本文解决了包含通配符的文本中识别回文因子的问题。这些符号挑战了许多经典算法,因为许多组合性质在它们存在时不再成立。我们应用现有的通配符LCE技术,获得连续的时间-空间折中,并提出首个非平凡的线性空间算法,用于计算所有带有通配符的极大连环结构,从而在某些参数范围内改进了已知的最佳时间-空间乘积。我们的主要结果是算法用于在给定文本中找到和近似所有极大连环结构。我们还将两种方法推广到k-错误设置,无论是否包含通配符。
英文摘要:
This paper addresses the problem of identifying palindromic factors in texts that include wildcards -- special characters that match all others. These symbols challenge many classical algorithms, as numerous combinatorial properties are not satisfied in their presence. We apply existing wildcard-LCE techniques to obtain a continuous time-memory tradeoff, and present the first non-trivial linear-space algorithm for computing all maximal palindromes with wildcards, improving the best known time-memory product in certain parameter ranges. Our main results are algorithms to find and approximate all maximal palindromes in a given text. We also generalize both methods to the $k$-mismatches setting, with or without wildcards.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。