arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0807.0051q-bio.GNq-bio.QM
收藏

二元序列最优对齐的下界

Lower Bounds for Optimal Alignments of Binary Sequences

Cynthia Vinzant

摘要:

在参数序列比对中,两个序列的最佳比对被计算为错配和间隔的惩罚的函数,产生许多不同的最佳比对。这里我们给出了长度为n的二元序列的不同最佳比对摘要的最大数目的3/(2^{7/3}π^{2/3})n^{2/3} +O(n^{1/3} \log n)下界。这表明Gusfield et.在所有字母表上都是紧的,从而反驳了“n的平方根猜想”。因此,在所有长度为n的序列对上的不同的最佳比对概要(即,比对多面体的顶点)的最大数目是Theta(n^{2/3})。

英文摘要:

In parametric sequence alignment, optimal alignments of two sequences are computed as a function of the penalties for mismatches and spaces, producing many different optimal alignments. Here we give a 3/(2^{7/3}π^{2/3})n^{2/3} +O(n^{1/3} \log n) lower bound on the maximum number of distinct optimal alignment summaries of length-n binary sequences. This shows that the upper bound given by Gusfield et. al. is tight over all alphabets, thereby disproving the "square root of n conjecture". Thus the maximum number of distinct optimal alignment summaries (i.e. vertices of the alignment polytope) over all pairs of length-n sequences is Theta(n^{2/3}).

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

↑