The Statistics of Repeats

不精确简单重复可以量化为马尔可夫加性过程（MAP）中的局部和。局部和的最大值具有渐近冈贝尔分布，由一般MAP公式给出。一般的MAP公式通常在计算上难以处理，但是在重复的情况下，一个重要的简化允许从维度等于相关字母表大小的矩阵中计算Gumbel参数。我对未断开重复序列的分析结果比G. Achaz et al. (2006) reseek（一种从大DNA序列中检索近似重复序列的工具）的模拟结果更详细。生物信息学。使用Ruzzo-Tompa算法查找重复序列并对结果进行评估的程序的工作原型在NCBI内部可用。

Inexact simple repeats can be quantified as local sums in a Markov additive process (MAP). The maximum of the local sums has an asymptotic Gumbel distribution, which are given by general MAP formulas. The general MAP formulas are usually computationally intractable, but an essential simplification in the case of repeats permits the Gumbel parameters to be computed from matrices whose dimension equals the size of the relevant alphabet. My analytic results for ungapped repeats are more detailed than those derived by simulation in G. Achaz et al. (2006) Repseek, a tool to retrieve approximate repeats from large DNA sequences. Bioinformatics. A working prototype of program for finding repeats with the Ruzzo-Tompa algorithm and then evaluating the results is available internally, within NCBI.