An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Book Sections Year : 2010

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.
Fichier principal
Vignette du fichier
camera-ready_accepted_by_all.pdf (329.58 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00818889 , version 1 (29-04-2013)

Identifiers

Cite

Jean-Philippe Doyon, Celine Scornavacca, Yu Gorbunov, Gergely J. Szöllősi, Vincent Ranwez, et al.. An Efficient Algorithm for Gene/Species Trees Parsimonious Reconciliation with Losses, Duplications and Transfers. Eric Tannier. Comparative Genomics. RECOMB-CG 2010, LNCS (6398), Springer Berlin Heidelberg, pp.93-108, 2010, 978-3-642-16181-0. ⟨10.1007/978-3-642-16181-0_9⟩. ⟨lirmm-00818889⟩
536 View
749 Download

Altmetric

Share

Gmail Facebook X LinkedIn More