Evolution of Genes Neighborhood Within Reconciled Phylogenies: An Ensemble Approach

Resource type
Date created
2015
Authors/Contributors
Abstract
ContextThe reconstruction of evolutionary scenarios for whole genomes in terms of genome rearrangements is a fundamental problem in evolutionary and comparative genomics. The DeCo algorithm, recently introduced by Bérard et al., computes parsimonious evolutionary scenarios for gene adjacencies, from pairs of reconciled gene trees. However, as for many combinatorial optimization algorithms, there can exist many co-optimal, or slightly sub-optimal, evolutionary scenarios that deserve to be considered.ContributionWe extend the DeCo algorithm to sample evolutionary scenarios from the whole solution space under the Boltzmann distribution, and also to compute Boltzmann probabilities for specific ancestral adjacencies.ResultsWe apply our algorithms to a dataset of mammalian gene trees and adjacencies, and observe a significant reduction of the number of syntenic conflicts observed in the resulting ancestral gene adjacencies.
Document
Published as
Chauve C, Ponty Y, Zanetti J. Evolution of genes neighborhood within reconciled phylogenies: an ensemble approach. BMC Bioinformatics. 2015;16 Suppl 19:S6. doi: 10.1186/1471-2105-16-S19-S6. Epub 2015 Dec 16.
Publication title
BMC Bioinformatics
Document title
Evolution of Genes Neighborhood Within Reconciled Phylogenies: An Ensemble Approach
Date
2015
Publisher DOI
10.1186/1471-2105-16-S19-S6
Copyright statement
Copyright is held by the author(s).
Scholarly level
Peer reviewed?
Yes
Language
Member of collection
Attachment Size
1471-2105-16-S19-S6.pdf 1.07 MB