Abstract
AbstractGiven a set of species whose evolution is represented by a species tree, a gene family is a group of genes having evolved from a single ancestral gene. A gene family evolves along the branches of a species tree through various mechanisms, including—but not limited to—speciation ($${\mathbb {S}}$$S), gene duplication ($${\mathbb {D}}$$D), gene loss ($${\mathbb {L}}$$L), and horizontal gene transfer ($${\mathbb {T}}$$T). The reconstruction of a gene tree representing the evolution of a gene family constrained by a species tree is an important problem in phylogenomics. However, unlike in the multispecies coalescent evolutionary model that considers only speciation and incomplete lineage sorting events, very little is known about the search space for gene family histories accounting for gene duplication, gene loss and horizontal gene transfer (the $${\mathbb {D}}{\mathbb {L}}{\mathbb {T}}$$DLT-model). In this work, we introduce the notion of evolutionary histories defined as a binary ordered rooted tree describing the evolution of a gene family, constrained by a species tree in the $${\mathbb {D}}{\mathbb {L}}{\mathbb {T}}$$DLT-model. We provide formal grammars describing the set of all evolutionary histories that are compatible with a given species tree, whether it is ranked or unranked. These grammars allow us, using either analytic combinatorics or dynamic programming, to efficiently compute the number of histories of a given size, and also to generate random histories of a given size under the uniform distribution. We apply these tools to obtain exact asymptotics for the number of gene family histories for two species trees, the rooted caterpillar and complete binary tree, as well as estimates of the range of the exponential growth factor of the number of histories for random species trees of size up to 25. Our results show that including horizontal gene transfers induce a dramatic increase of the number of evolutionary histories. We also show that, within ranked species trees, the number of evolutionary histories in the $${\mathbb {D}}{\mathbb {L}}{\mathbb {T}}$$DLT-model is almost independent of the species tree topology. These results establish firm foundations for the development of ensemble methods for the prediction of reconciliations.
Funder
Austrian Science Fund
NSERC
Austrian Federal Ministry of Education, Science and Research
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Agricultural and Biological Sciences (miscellaneous),Modeling and Simulation
Reference61 articles.
1. Åkerborg Ö, Sennblad B, Arvestad L, Lagergren J (2009) Simultaneous Bayesian gene tree reconstruction and reconciliation analysis. Proc Natl Acad Sci 106(14):5714–5719
2. Arvestad L, Lagergren J, Sennblad B (2009) The gene evolution model and computing its associated probabilities. J ACM 56(2):7:1–7:44
3. ban Chan Y, Ranwez V, Scornavacca C (2017) Inferring incomplete lineage sorting, duplications, transfers and losses with reconciliations. J Theor Biol 432:1–13
4. Banderier C, Wallner M (2016) Lattice paths with catastrophes. Discrete Math Theor Comput Sci 19(1), Sept. 2017. Full version of extended abstract with the same title appeared in the proceedings of conference on random generation of combinatorial structures—GASCom
5. Bansal MS, Alm EJ, Kellis M (2013) Reconciliation revisited: handling multiple optima when reconciling with duplication, transfer, and loss. J Comput Biol 20(10):738–754
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献