ArticleAlgorithms for molecular biology : AMB2013
Reconciliation and local gene tree rearrangement can be of mutual profit.
Article in Algorithms for molecular biology : AMB, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 15 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
15 citing papers in PubMed.
- Phylogenetic reconciliation.PLoS computational biology · 2022Article
- Non-parametric correction of estimated gene trees using TRACTION.Algorithms for molecular biology : AMB · 2020Article
- Reconciling multiple genes trees via segmental duplications and losses.Algorithms for molecular biology : AMB · 2019Article
- GATC: a genetic algorithm for gene tree construction under the Duplication-Transfer-Loss model of evolution.BMC genomics · 2018Article
- Naturally Occurring Isoleucyl-tRNA Synthetase without tRNA-dependent Pre-transfer Editing.The Journal of biological chemistry · 2016Article
- Efficient Gene Tree Correction Guided by Genome Evolution.PloS one · 2016Article
- The link between orthology relations and gene trees: a correction perspective.Algorithms for molecular biology : AMB · 2016Article
- A fast method for calculating reliable event supports in tree reconciliations via Pareto optimality.BMC bioinformatics · 2015Article
- Genomic and phenotypic differentiation among Methanosarcina mazei populations from Columbia River sediment.The ISME journal · 2015Article
- Inferring horizontal gene transfer.PLoS computational biology · 2015Article
- Joint amalgamation of most parsimonious reconciled gene trees.Bioinformatics (Oxford, England) · 2015Article
- Polytomy refinement for the correction of dubious duplications in gene trees.Bioinformatics (Oxford, England) · 2014Article
- Reconciliation-based detection of co-evolving gene families.BMC bioinformatics · 2013Article
- Support measures to estimate the reliability of evolutionary events predicted by reconciliation methods.PloS one · 2013Article
- Gene tree correction guided by orthology.BMC bioinformatics · 2013Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
6 authors.
Funding
No grant is acknowledged in the PubMed record.
Abstract
backgroundReconciliation methods compare gene trees and species trees to recover evolutionary events such as duplications, transfers and losses explaining the history and composition of genomes. It is well-known that gene trees inferred from molecular sequences can be partly erroneous due to incorrect sequence alignments as well as phylogenetic reconstruction artifacts such as long branch attraction. In practice, this leads reconciliation methods to overestimate the number of evolutionary events. Several methods have been proposed to circumvent this problem, by collapsing the unsupported edges and then resolving the obtained multifurcating nodes, or by directly rearranging the binary gene trees. Yet these methods have been defined for models of evolution accounting only for duplications and losses, i.e. can not be applied to handle prokaryotic gene families.
resultsWe propose a reconciliation method accounting for gene duplications, losses and horizontal transfers, that specifically takes into account the uncertainties in gene trees by rearranging their weakly supported edges. Rearrangements are performed on edges having a low confidence value, and are accepted whenever they improve the reconciliation cost. We prove useful properties on the dynamic programming matrix used to compute reconciliations, which allows to speed-up the tree space exploration when rearrangements are generated by Nearest Neighbor Interchanges (NNI) edit operations. Experiments on synthetic data show that gene trees modified by such NNI rearrangements are closer to the correct simulated trees and lead to better event predictions on average. Experiments on real data demonstrate that the proposed method leads to a decrease in the reconciliation cost and the number of inferred events. Finally on a dataset of 30 k gene families, this reconciliation method shows a ranking of prokaryotic phyla by transfer rates identical to that proposed by a different approach dedicated to transfer detection [BMCBIOINF 11:324, 2010, PNAS 109(13):4962-4967, 2012].
conclusionsProkaryotic gene trees can now be reconciled with their species phylogeny while accounting for the uncertainty of the gene tree. More accurate and more precise reconciliations are obtained with respect to previous parsimony algorithms not accounting for such uncertainties [LNCS 6398:93-108, 2010, BIOINF 28(12): i283-i291, 2012].A software implementing the method is freely available at http://www.atgc-montpellier.fr/Mowgli/.
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.