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

基于快速有界差最小-加积的语言编辑距离和RNA折叠的真次立方算法

Truly Sub-cubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product

Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams

摘要:

两个$n\times n$矩阵的$(\min,+)$ -乘积是否具有真正的次立方(即$ε>0$的$O(n^{3-ε})$)时间算法是一个主要的开放问题,特别是因为它等价于$n$ -顶点图中的著名的全对最短路径问题(APSP)。已知$(\min,+)$ -乘积对特殊类型矩阵的一些限制允许真正的次立方算法,每个次立方算法产生可以更快求解的APSP的特殊情况。在本文中,我们考虑一个新的,不同的和强大的限制,其中所有矩阵的项目是整数和一个矩阵可以是任意的,只要其他矩阵有“有限的差异”,无论是在其列或行,即任何两个连续的项目只有少量的差异。我们获得了第一个真正的次立方算法,这个有界差分$(\min,+)$产品(回答一个开放的问题陈和Lewenstein)。我们的新算法,结合L.~ Valiant解决了上下文无关文法分析与矩阵乘法,产生了第一个真正的次立方算法,用于以下问题:语言编辑距离(分析社区的一个主要问题),RNA折叠(生物信息学的一个主要问题)和最佳堆栈生成(回答Tarjan的一个开放问题)。

英文摘要:

It is a major open problem whether the $(\min,+)$-product of two $n\times n$ matrices has a truly sub-cubic (i.e. $O(n^{3-ε})$ for $ε>0$) time algorithm, in particular since it is equivalent to the famous All-Pairs-Shortest-Paths problem (APSP) in $n$-vertex graphs. Some restrictions of the $(\min,+)$-product to special types of matrices are known to admit truly sub-cubic algorithms, each giving rise to a special case of APSP that can be solved faster. In this paper we consider a new, different and powerful restriction in which all matrix entries are integers and one matrix can be arbitrary, as long as the other matrix has "bounded differences" in either its columns or rows, i.e. any two consecutive entries differ by only a small amount. We obtain the first truly sub-cubic algorithm for this bounded-difference $(\min,+)$-product (answering an open problem of Chan and Lewenstein). Our new algorithm, combined with a strengthening of an approach of L.~Valiant for solving context-free grammar parsing with matrix multiplication, yields the first truly sub-cubic algorithms for the following problems: Language Edit Distance (a major problem in the parsing community), RNA-folding (a major problem in bioinformatics) and Optimum Stack Generation (answering an open problem of Tarjan).

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

↑