An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers

Abstract : Tree reconciliation methods aim at estimating the evolutionary events that cause discrepancy between gene trees and species trees. We provide a discrete computational model that considers duplications, transfers and losses of genes. The model yields a fast and exact algorithm to infer time consistent and most parsimonious reconciliations. Then we study the conditions under which parsimony is able to accurately infer such events. Overall, it performs well even under realistic rates, transfers being in general less accurately recovered than duplications. An implementation is freely available at http://www.atgc-montpellier.fr/MPR.
Document type :
Conference papers
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00818889
Contributor : Vincent Berry <>
Submitted on : Monday, April 29, 2013 - 3:07:31 PM
Last modification on : Tuesday, September 17, 2019 - 5:16:25 PM
Long-term archiving on : Monday, August 19, 2013 - 9:50:17 AM

File

camera-ready_accepted_by_all.p...
Files produced by the author(s)

Identifiers

Citation

Jean-Philippe Doyon, Celine Scornavacca, Yu Gorbunov, Gergely Szöllősi, Vincent Ranwez, et al.. An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers. RECOMB-CG: Comparative Genomics, Oct 2010, Ottawa, Canada. pp.93-108, ⟨10.1007/978-3-642-16181-0_9⟩. ⟨lirmm-00818889⟩

Share

Metrics

Record views

879

Files downloads

897