Maximum likelihood models and algorithms for gene tree evolution with duplications and losses.
Maximum likelihood models and algorithms for gene tree evolution with duplications and losses.
复制标题
基因树进化的最大似然模型和算法,并具有重复和损失。
DOI:
10.1186/1471-2105-12-s1-s15
复制
发表时间:
2011-02-15
影响因子:
3
通讯作者:
Eulenstein O
中科院分区:
文献类型:
--
作者:
Górecki P;Burleigh GJ;Eulenstein O
The abundance of new genomic data provides the opportunity to map the location of gene duplication and loss events on a species phylogeny. The first methods for mapping gene duplications and losses were based on a parsimony criterion, finding the mapping that minimizes the number of duplication and loss events. Probabilistic modeling of gene duplication and loss is relatively new and has largely focused on birth-death processes. We introduce a new maximum likelihood model that estimates the speciation and gene duplication and loss events in a gene tree within a species tree with branch lengths. We also provide an, in practice, efficient algorithm that computes optimal evolutionary scenarios for this model. We implemented the algorithm in the program DrML and verified its performance with empirical and simulated data. In test data sets, DrML finds optimal gene duplication and loss scenarios within minutes, even when the gene trees contain sequences from several hundred species. In many cases, these optimal scenarios differ from the lca-mapping that results from a parsimony gene tree reconciliation. Thus, DrML provides a new, practical statistical framework on which to study gene duplication.