arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2212.01582math.COcs.DMmath.PR
收藏

Chvátal-Sankoff问题:通过随机过程理解随机字符串比较

The Chvátal-Sankoff problem: Understanding random string comparison through stochastic processes

Alexander Tiskin

AI总结:

针对1975年提出的、尚未解决的Chvátal-Sankoff问题(求随机二进制串归一化最长公共子序列长度的极限系数$γ$),研究结合统计力学方法与LCS组合结构已有结果,将$γ$与随机粒子过程参数关联,得到了$γ$的新估计。

摘要:

给定两条等长的均匀随机二进制字符串,它们的最长公共子序列(LCS)的期望长度与字符串长度渐近成正比。求比例系数$γ$,即长度为$n$的两条随机二进制字符串的归一化LCS长度在$n \to \infty$时的极限,是一个非常自然的问题,由Chvátal和Sankoff于1975年首次提出,至今尚未解决。该问题与组合数学、算法分析、编码理论、计算生物学等多个领域相关。我们利用统计力学方法以及关于LCS组合结构的一些已有结果,将常数$γ$与某一随机粒子过程的参数联系起来,并借此得到了$γ$的一个新估计值。

英文摘要:

Given two equally long, uniformly random binary strings, the expected length of their longest common subsequence (LCS) is asymptotically proportional to the strings' length. Finding the proportionality coefficient $γ$, i.e. the limit of the normalised LCS length for two random binary strings of length $n \to \infty$, is a very natural problem, first posed by Chvátal and Sankoff in 1975, and as yet unresolved. This problem has relevance to diverse fields ranging from combinatorics and algorithm analysis to coding theory and computational biology. Using methods of statistical mechanics, as well as some existing results on the combinatorial structure of LCS, we link constant $γ$ to the parameters of a certain stochastic particle process, which we use to obtain a new estimate for $γ$.

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

↑