BACKGROUND Various approaches to alignment-free sequence comparison are based on the length of exact or inexact word matches between pairs of input sequences. Haubold et al. (J Comput Biol 16:1487-1500, 2009) showed how the average number of substitutions per position between two DNA sequences can be estimated based on the average length of exact common substrings. RESULTS In this paper, we study the length distribution of k-mismatch common substrings between two sequences. We show that the number of substitutions per position can be accurately estimated from the position of a local maximum in the length distribution of their k-mismatch common substrings.

中文翻译：

---

基于k失配公共子串长度分布的系统发育重建。


背景技术免比对序列比较的各种方法是基于输入序列对之间的精确或不精确单词匹配的长度。豪博尔德等人。 (J Comput Biol 16:1487-1500, 2009) 展示了如何根据精确公共子串的平均长度来估计两个 DNA 序列之间每个位置的平均取代数。结果在本文中，我们研究了两个序列之间k失配公共子串的长度分布。我们表明，每个位置的替换数量可以根据 k 失配公共子串的长度分布中的局部最大值的位置来准确估计。