Show simple item record

dc.contributor.authorWu, Yi-Chieh
dc.contributor.authorBansal, Mukul S.
dc.contributor.authorKellis, Manolis
dc.contributor.authorRasmussen, Matthew D.
dc.date.accessioned2014-03-17T15:50:25Z
dc.date.available2014-03-17T15:50:25Z
dc.date.issued2013-12
dc.date.submitted2013-11
dc.identifier.issn1088-9051
dc.identifier.urihttp://hdl.handle.net/1721.1/85673
dc.description.abstractAccurate gene tree-species tree reconciliation is fundamental to inferring the evolutionary history of a gene family. However, although it has long been appreciated that population-related effects such as incomplete lineage sorting (ILS) can dramatically affect the gene tree, many of the most popular reconciliation methods consider discordance only due to gene duplication and loss (and sometimes horizontal gene transfer). Methods that do model ILS are either highly parameterized or consider a restricted set of histories, thus limiting their applicability and accuracy. To address these challenges, we present a novel algorithm DLCpar for inferring a most parsimonious (MP) history of a gene family in the presence of duplications, losses, and ILS. Our algorithm relies on a new reconciliation structure, the labeled coalescent tree (LCT), that simultaneously describes coalescent and duplication-loss history. We show that the LCT representation enables an exhaustive and efficient search over the space of reconciliations, and, for most gene families, the least common ancestor (LCA) mapping is an optimal solution for the species mapping between the gene tree and species tree in an MP LCT. Applying our algorithm to a variety of clades, including flies, fungi, and primates, as well as to simulated phylogenies, we achieve high accuracy, comparable to sophisticated probabilistic reconciliation methods, at reduced run time and with far fewer parameters. These properties enable inferences of the complex evolution of gene families across a broad range of species and large data sets.en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (CAREER Award 0644282)en_US
dc.description.sponsorshipNational Institutes of Health (U.S.) (MIT/Whitehead/Broad Computational Genetics Training Program Grant)en_US
dc.language.isoen_US
dc.publisherCold Spring Harbor Laboratory Pressen_US
dc.relation.isversionofhttp://dx.doi.org/10.1101/gr.161968.113en_US
dc.rightsCreative Commons Attribution-Noncommericalen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc/3.0/en_US
dc.sourceCold Spring Harbor Laboratory Pressen_US
dc.titleMost parsimonious reconciliation in the presence of gene duplication, loss, and deep coalescence using labeled coalescent treesen_US
dc.typeArticleen_US
dc.identifier.citationWu, Y.-C., M. D. Rasmussen, M. S. Bansal, and M. Kellis. “Most Parsimonious Reconciliation in the Presence of Gene Duplication, Loss, and Deep Coalescence Using Labeled Coalescent Trees.” Genome Research 24, no. 3 (March 1, 2014): 475–486.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.mitauthorWu, Yi-Chiehen_US
dc.contributor.mitauthorBansal, Mukul S.en_US
dc.contributor.mitauthorKellis, Manolisen_US
dc.relation.journalGenome Researchen_US
dc.eprint.versionFinal published versionen_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dspace.orderedauthorsWu, Y.-C.; Rasmussen, M. D.; Bansal, M. S.; Kellis, M.en_US
mit.licensePUBLISHER_CCen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record