Representing a set of reconciliations in a compact way - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Journal Articles Journal of Bioinformatics and Computational Biology Year : 2013

Representing a set of reconciliations in a compact way

Abstract

Comparative genomic studies are often conducted by reconciliation analyses comparing gene and species trees. One of the issues with reconciliation approaches is that an exponential number of optimal scenarios is possible. The resulting complexity is masked by the fact that a majority of reconciliation software pick up a random optimal solution that is returned to the end-user. However, the alternative solutions should not be ignored since they tell different stories that parsimony considers as viable as the output solution. In this paper, we describe a polynomial space and time algorithm to build a minimum reconciliation graph -- a graph that summarizes the set of all most parsimonious reconciliations. Amongst numerous applications, it is shown how this graph allows counting the number of non-equivalent most parsimonious reconciliations.
Fichier principal
Vignette du fichier
article_graphDTL.pdf (512.78 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

lirmm-00818801 , version 1 (22-05-2013)

Identifiers

Cite

Celine Scornavacca, Wojciech Paprotny, Vincent Berry, Vincent Ranwez. Representing a set of reconciliations in a compact way. Journal of Bioinformatics and Computational Biology, 2013, 11 (2), pp.1250025. ⟨10.1142/S0219720012500254⟩. ⟨lirmm-00818801⟩
800 View
713 Download

Altmetric

Share

Gmail Facebook X LinkedIn More