Who is Who in Phylogenetic Networks

Publication no #2188   Type :   Html | Bib | Both

Created: 2012-03-20 14:28:18     Modified: 2014-07-09 14:21:32

2188 Mukul S. Bansal, Eric J. Alm and Manolis Kellis. Efficient Algorithms for the Reconciliation Problem with Gene Duplication, Horizontal Transfer, and Loss. In ISMB12, Vol. 28(12):i283-i291 of BIO, 2012. Keywords: duplication, explicit network, from rooted trees, from species tree, lateral gene transfer, loss, phylogenetic network, phylogeny, Program Angst, Program Mowgli, Program RANGER-DTL, reconstruction. Note: http://dx.doi.org/10.1093/bioinformatics/bts225.         Toggle abstract "Motivation: Gene family evolution is driven by evolutionary events such as speciation, gene duplication, horizontal gene transfer and gene loss, and inferring these events in the evolutionary history of a given gene family is a fundamental problem in comparative and evolutionary genomics with numerous important applications. Solving this problem requires the use of a reconciliation framework, where the input consists of a gene family phylogeny and the corresponding species phylogeny, and the goal is to reconcile the two by postulating speciation, gene duplication, horizontal gene transfer and gene loss events. This reconciliation problem is referred to as duplication-transfer-loss (DTL) reconciliation and has been extensively studied in the literature. Yet, even the fastest existing algorithms for DTL reconciliation are too slow for reconciling large gene families and for use in more sophisticated applications such as gene tree or species tree reconstruction.Results: We present two new algorithms for the DTL reconciliation problem that are dramatically faster than existing algorithms, both asymptotically and in practice. We also extend the standard DTL reconciliation model by considering distance-dependent transfer costs, which allow for more accurate reconciliation and give an efficient algorithm for DTL reconciliation under this extended model. We implemented our new algorithms and demonstrated up to 100 000-fold speed-up over existing methods, using both simulated and biological datasets. This dramatic improvement makes it possible to use DTL reconciliation for performing rigorous evolutionary analyses of large gene families and enables its use in advanced reconciliation-based gene and species tree reconstruction methods. © The Author(s) 2012. Published by Oxford University Press." @InProceedings{BAK2012,       AUTHOR = {Bansal, Mukul S. and Alm, Eric J. and Kellis, Manolis},       TITLE = {Efficient Algorithms for the Reconciliation Problem with Gene Duplication, Horizontal Transfer, and Loss},       YEAR = {2012},       BOOKTITLE = {ISMB12},       VOLUME = {28},       NUMBER = {12},       PAGES = {i283-i291},       SERIES = {BIO},       URL = {http://dx.doi.org/10.1093/bioinformatics/bts225},       NOTE = {http://dx.doi.org/10.1093/bioinformatics/bts225},       KEYWORDS = {duplication, explicit network, from rooted trees, from species tree, lateral gene transfer, loss, phylogenetic network, phylogeny, Program Angst, Program Mowgli, Program RANGER-DTL, reconstruction} }