Recognition of an organism from fragments of its complete genome
Recognition of an organism from fragments of its complete genome
复制标题
从完整基因组片段识别生物体
DOI：
10.1103/physreve.66.031910
复制
发表时间：
2002-09-01
影响因子：
2.4
通讯作者：
Yu, ZG
中科院分区：
文献类型：
--
作者：
Anh, VV;Lau, KS;Yu, ZG
本文考虑了利用生物体的完整基因组来匹配一个片段的问题。我们的方法是基于基因组的概率度量表示。我们首先证明了这些概率度量可以建模为由四个压缩相似度组成的循环迭代函数系统（RIFS）。我们的假设是，RIFS捕获的完整基因组概率测量的多重分形特征保存在其相当长的片段中。我们计算了不同长度和随机起始点的片段的RIFS，并使用欧几里得距离与原始序列的RIFS进行比较，以便识别。对随机选择的五种生物进行的演示支持上述假设。
This paper considers the problem of matching a fragment to an organism using its complete genome. Our method is based on the probability measure representation of a genome. We first demonstrate that these probability measures can be modeled as recurrent iterated function systems (RIFS) consisting of four contractive similarities. Our hypothesis is that the multifractal characteristics of the probability measure of a complete genome, as captured by the RIFS, is preserved in its reasonably long fragments. We compute the RIFS of fragments of various lengths and random starting points, and compare with that of the original sequence for recognition using the Euclidean distance. A demonstration on five randomly selected organisms supports the above hypothesis.