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

Jean-Philippe Doyon (1) , Celine Scornavacca (2) , Yu Gorbunov (3) , Gergely J. Szöllősi (4) , Vincent Ranwez (5) , Vincent Berry (6)

1 LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
2 Center for Bioinformatics (ZBIT)
3 IITP - Institute for Information Transmission Problems
4 BPGE - Bioinformatique, phylogénie et génomique évolutive
5 UMR ISEM - Institut des Sciences de l'Evolution de Montpellier
6 MAB - Méthodes et Algorithmes pour la Bioinformatique

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.

Domaines: Algorithme et structure de données [cs.DS]

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⟩