Mathematical Foundations of Computer Science 2004

Mathematical Foundations of Computer Science 2004
复制标题

计算机科学数学基础 2004

DOI:
--
复制
发表时间:
2004
期刊:
Lecture Notes in Computer Science
影响因子:
--
通讯作者:
Jan Kratochvíl
Jan Kratochvíl
中科院分区:
--
文献类型:
--
作者:
J. Fiala;Václav Koubek;Jan Kratochvíl

文献摘要

被引文献

相似文献

我们介绍和分析了一个简单的基因组进化模型。它基于两个基本的进化事件:基因丢失和基因复制。我们主要对基因组中基因家族的渐近分布感兴趣。这是由以前的工作推动的,这些工作包括将可用的基因组数据拟合到所谓的平行对数分布中。本文提出了两种方法:连续时间模型和离散时间模型。当基因丢失和基因复制的概率趋于零时,连续时间模型的渐近分布可以看作是离散时间分布的极限。我们把这篇论文看作是在数学上解决描述细菌基因组中准对数分布形状的问题的中间步骤。
We introduce and analyse a simple model of genome evolution. It is based on two fundamental evolutionary events: gene loss and gene duplication. We are mainly interested in asymptotic distributions of gene families in a genome. This is motovated by previous work which consisted in fitting the available genomic data into, what is called paralog distributions. Two approaches are presented in this paper: continuous and discrete time models. A comparison of them is presented too – the asymptotic distribution for the continuous time model can be seen as a limit of the discrete time distributions, when probabilities of gene loss and gene duplication tend to zero. We view this paper as an intermediate step towards mathematically settling the problem of characterizing the shape of paralog distribution in bacterial genomes.