Accounting for gene tree uncertainty improves gene tree accuracy as well as duplications, transfers and losses predictions

Thi-Hau Nguyen (1) , Jean-Philippe Doyon (1) , Stéphanie Pointet (1) , Anne-Muriel Arigon Chifolleau (2) , Vincent Ranwez (3) , Vincent Berry (1)

1 MAB - Méthodes et Algorithmes pour la Bioinformatique
2 LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
3 UMR AGAP - Amélioration génétique et adaptation des plantes méditerranéennes et tropicales

We propose a reconciliation heuristic accounting for gene duplications, losses and horizontal transfers that specifically takes into account the uncertainties in the gene tree. Rearrangements are tried for gene tree edges that are weakly supported, and are accepted whenever they improve the reconciliation cost. We prove useful properties on the dynamic programming matrix used to compute reconciliations, which al- lows to speed-up the tree space exploration when rearrangements are generated by Nearest Neighbor Interchanges (NNI) edit operations. Experimental results on simulated and real data confirm that running times are greatly reduced when considering the above-mentioned optimization in comparison to the naïve rearrangement procedure. Results also show that gene trees modified by such NNI rearrangements are closer to the correct (simulated) trees and lead to more correct event predictions on average. The program is available at http://www.atgc-montpellier.fr/Mowgli/

Domaines: Bio-Informatique, Biologie Systémique [q-bio.QM]; Bio-informatique [q-bio.QM]

Thi-Hau Nguyen, Jean-Philippe Doyon, Stéphanie Pointet, Anne-Muriel Arigon Chifolleau, Vincent Ranwez, et al.. Accounting for gene tree uncertainty improves gene tree accuracy as well as duplications, transfers and losses predictions. WABI'12 : Workshop on Algorithms in Bioinformatics, Sep 2012, Ljubljana, Slovenia. non connu pour le moment. ⟨hal-00718347v2⟩