VNU-UET Repository

Support Measures to Estimate the Reliability of Evolutionary Events Predicted by Reconciliation Methods

Nguyen, Thi Hau and Berry, Vincent and Ranwez, Vincent and Scornavacca, Celine (2013) Support Measures to Estimate the Reliability of Evolutionary Events Predicted by Reconciliation Methods. PLOS ONE . ISSN 1932-6203

Full text not available from this repository.

Abstract

The genome content of extant species is derived from that of ancestral genomes, distorted by evolutionary events such as gene duplications, transfers and losses. Reconciliation methods aim at recovering such events and at localizing them in the species history, by comparing gene family trees to species trees. These methods play an important role in studying genome evolution as well as in inferring orthology relationships. A major issue with reconciliation methods is that the reliability of predicted evolutionary events may be questioned for various reasons: Firstly, there may be multiple equally optimal reconciliations for a given species tree–gene tree pair. Secondly, reconciliation methods can be misled by inaccurate gene or species trees. Thirdly, predicted events may fluctuate with method parameters such as the cost or rate of elementary events. For all of these reasons, confidence values for predicted evolutionary events are sorely needed. It was recently suggested that the frequency of each event in the set of all optimal reconciliations could be used as a support measure. We put this proposition to the test here and also consider a variant where the support measure is obtained by additionally accounting for suboptimal reconciliations. Experiments on simulated data show the relevance of event supports computed by both methods, while resorting to suboptimal sampling was shown to be more effective. Unfortunately, we also show that, unlike the majority-rule consensus tree for phylogenies, there is no guarantee that a single reconciliation can contain all events having above 50% support. In this paper, we detail how to rely on the reconciliation graph to efficiently identify the median reconciliation. Such median reconciliation can be found in polynomial time within the potentially exponential set of most parsimonious reconciliations.

Item Type: Article
Subjects: Information Technology (IT)
ISI-indexed journals
Divisions: Faculty of Information Technology (FIT)
Depositing User: Nguy�n Th
Date Deposited: 03 Sep 2016 06:24
Last Modified: 03 Sep 2016 06:24
URI: http://eprints.uet.vnu.edu.vn/eprints/id/eprint/1861

Actions (login required)

View Item View Item