Evidence map›Paper›PMID 27513924›Full record

ArticlePloS one2016

Efficient Gene Tree Correction Guided by Genome Evolution.

Emmanuel Noutahi, Magali Semeria, Manuel Lafond, Jonathan Seguin, Bastien Boussau, Laurent Guéguen, Nadia El-Mabrouk, Eric Tannier

Abstract read
In one paragraph

Article in PloS one, 2016. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 23 papers.

0numbers the graph read from it
0cells of the map it votes in
23citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

23 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Article
  8. Article
  9. Non-parametric correction of estimated gene trees using TRACTION.Algorithms for molecular biology : AMB · 2020
    Article
  10. Advances and Applications in the Quest for Orthologs.Molecular biology and evolution · 2019
    Article
  11. Article
  12. RecPhyloXML: a format for reconciled gene trees.Bioinformatics (Oxford, England) · 2018
    Article
  13. Revised Phylogeny of thePlant physiology · 2018
    Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. OCTAL: Optimal Completion of gene trees in polynomial time.Algorithms for molecular biology : AMB · 2018
    Article
  19. Article
  20. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

8 authors.

Emmanuel NoutahiDépartement d'Informatique (DIRO), Université de Montréal, H3C3J7 Montréal, Canada.
Magali SemeriaLBBE, UMR CNRS 5558, Université de Lyon 1, F-69622 Villeurbanne, France.
Manuel LafondDépartement d'Informatique (DIRO), Université de Montréal, H3C3J7 Montréal, Canada.
Jonathan SeguinDépartement d'Informatique (DIRO), Université de Montréal, H3C3J7 Montréal, Canada.
Bastien BoussauLBBE, UMR CNRS 5558, Université de Lyon 1, F-69622 Villeurbanne, France.
Laurent GuéguenLBBE, UMR CNRS 5558, Université de Lyon 1, F-69622 Villeurbanne, France.
Nadia El-MabroukDépartement d'Informatique (DIRO), Université de Montréal, H3C3J7 Montréal, Canada.
Eric TannierLBBE, UMR CNRS 5558, Université de Lyon 1, F-69622 Villeurbanne, France.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

motivationsGene trees inferred solely from multiple alignments of homologous sequences often contain weakly supported and uncertain branches. Information for their full resolution may lie in the dependency between gene families and their genomic context. Integrative methods, using species tree information in addition to sequence information, often rely on a computationally intensive tree space search which forecloses an application to large genomic databases.

resultsWe propose a new method, called ProfileNJ, that takes a gene tree with statistical supports on its branches, and corrects its weakly supported parts by using a combination of information from a species tree and a distance matrix. Its low running time enabled us to use it on the whole Ensembl Compara database, for which we propose an alternative, arguably more plausible set of gene trees. This allowed us to perform a genome-wide analysis of duplication and loss patterns on the history of 63 eukaryote species, and predict ancestral gene content and order for all ancestors along the phylogeny. AVAILABILITY: A web interface called RefineTree, including ProfileNJ as well as a other gene tree correction methods, which we also test on the Ensembl gene families, is available at: http://www-ens.iro.umontreal.ca/~adbit/polytomysolver.html. The code of ProfileNJ as well as the set of gene trees corrected by ProfileNJ from Ensembl Compara version 73 families are also made available.

Indexed as

AlgorithmsEvolution, MolecularPhylogenyAnimalsComputational BiologyGenesGenomeHumansSequence Analysis, DNA

Identifiers

PMID27513924
PMCPMC4981423

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

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.