arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1305.3801q-bio.PEmath.PR
收藏

核苷酸序列的符号复杂性:基因组结构的标志

Symbolic Complexity for Nucleotide Sequences: A Sign of the Genome Structure

R. Salgado-Garcia, E. Ugalde

摘要:

我们介绍了一种方法来估计符号动力系统的复杂性函数从一个有限的符号序列。我们测试了几个符号动力系统的复杂性函数的复杂性估计。我们使用这种技术来估计的复杂性函数的基因组的几种生物体的假设下,基因组是一个序列产生的(未知的)动力系统。我们发现,几种生物体的基因组共享的属性,其复杂性函数表现为指数的小长度$\ell$($0\leq \ell \leq 10$)和线性的字长度范围内的$11 \leq \ell \leq 50$的话。同时还发现,遗传学上相互接近的物种具有相似的复杂性函数,这些复杂性函数是由它们相应的编码区样本计算的。

英文摘要:

We introduce a method to estimate the complexity function of symbolic dynamical systems from a finite sequence of symbols. We test such complexity estimator on several symbolic dynamical systems whose complexity functions are known exactly. We use this technique to estimate the complexity function for genomes of several organisms under the assumption that a genome is a sequence produced by a (unknown) dynamical system. We show that the genome of several organisms share the property that their complexity functions behaves exponentially for words of small length $\ell$ ($0\leq \ell \leq 10$) and linearly for word lengths in the range $11 \leq \ell \leq 50$. It is also found that the species which are phylogenetically close each other have similar complexity functions calculated from a sample of their corresponding coding regions.

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

↑