生物序列中k字匹配的经验分布
Empirical distribution of k-word matches in biological sequences
摘要:
本文研究了一种无冗余的序列比较方法:两个序列之间共享长度为k的字的数量,也称为D_2统计量。使用该统计量优于基于序列的方法的优点在于,首先,它不假设同源片段是连续的,其次,该算法在计算上非常快,运行时间与仔细检查的序列的大小成比例。D_2统计量的现有应用包括在大型EST数据库(如STACK数据库)中相关序列的聚类。此类应用程序通常依赖于启发式方法,没有任何统计基础。严格的统计特性的分布D_2随后进行,但集中在分布的渐近行为,离开分布D_2的特点,为大多数实际情况。这里提出的工作桥梁这两个世界,给出可用的近似值的D_2的分布范围内的参数最经常遇到的生物序列的研究。
英文摘要:
This study focuses on an alignment-free sequence comparison method: the number of words of length k shared between two sequences, also known as the D_2 statistic. The advantages of the use of this statistic over alignment-based methods are firstly that it does not assume that homologous segments are contiguous, and secondly that the algorithm is computationally extremely fast, the runtime being proportional to the size of the sequence under scrutiny. Existing applications of the D_2 statistic include the clustering of related sequences in large EST databases such as the STACK database. Such applications have typically relied on heuristics without any statistical basis. Rigorous statistical characterisations of the distribution of D_2 have subsequently been undertaken, but have focussed on the distribution's asymptotic behaviour, leaving the distribution of D_2 uncharacterised for most practical cases. The work presented here bridges these two worlds to give usable approximations of the distribution of D_2 for ranges of parameters most frequently encountered in the study of biological sequences.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。