Evidence map›Paper›PMID 25646426›Full record

ArticleProceedings of the National Academy of Sciences of the United States of America2015

Phylogenomics with paralogs.

Marc Hellmuth, Nicolas Wieseke, Marcus Lechner, Hans-Peter Lenhof, Martin Middendorf, Peter F Stadler

Abstract read
In one paragraph

Article in Proceedings of the National Academy of Sciences of the United States of America, 2015. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 39 papers.

0numbers the graph read from it
0cells of the map it votes in
39citing 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

39 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Article
  6. Orthology and near-cographs in the context of phylogenetic networks.Algorithms for molecular biology : AMB · 2025
    Article
  7. Article
  8. The Theory of Gene Family Histories.Methods in molecular biology (Clifton, N.J.) · 2024
    Article
  9. Clustering systems of phylogenetic networks.Theory in biosciences = Theorie in den Biowissenschaften · 2023
    Article
  10. Review
  11. Article
  12. Article
  13. Article
  14. Article
  15. Article
  16. Review
  17. Indirect identification of horizontal gene transfer.Journal of mathematical biology · 2021
    Article
  18. 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

6 authors.

Marc HellmuthCenter for Bioinformatics, Saarland University, D-66041 Saarbrücken, Germany; mhellmuth@bioinf.uni-sb.de.
Nicolas WiesekeParallel Computing and Complex Systems Group, Department of Computer Science, Leipzig University, D-04109 Leipzig, Germany;
Marcus LechnerInstitut für Pharmazeutische Chemie, Philipps-Universität Marburg, D-35032 Marburg, Germany;
Hans-Peter LenhofCenter for Bioinformatics, Saarland University, D-66041 Saarbrücken, Germany;
Martin MiddendorfParallel Computing and Complex Systems Group, Department of Computer Science, Leipzig University, D-04109 Leipzig, Germany;
Peter F StadlerBioinformatics Group, Department of Computer Science, and Interdisciplinary Center of Bioinformatics, Leipzig University, D-04107 Leipzig, Germany; Max Planck Institute for Mathematics in the Sciences, D-04103 Leipzig, Germany; Fraunhofer Institute for Cell Therapy and Immunology, Leipzig, Germany; Institute for Theoretical Chemistry, University of Vienna, A-1090 Vienna, Austria; Center for Non-Coding RNA in Technology and Health, University of Copenhagen, 1870 Frederiksberg C, Denmark; and Santa Fe Institute, Santa Fe, NM 87501.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Phylogenomics heavily relies on well-curated sequence data sets that comprise, for each gene, exclusively 1:1 orthologos. Paralogs are treated as a dangerous nuisance that has to be detected and removed. We show here that this severe restriction of the data sets is not necessary. Building upon recent advances in mathematical phylogenetics, we demonstrate that gene duplications convey meaningful phylogenetic information and allow the inference of plausible phylogenetic trees, provided orthologs and paralogs can be distinguished with a degree of certainty. Starting from tree-free estimates of orthology, cograph editing can sufficiently reduce the noise to find correct event-annotated gene trees. The information of gene trees can then directly be translated into constraints on the species trees. Although the resolution is very poor for individual gene families, we show that genome-wide data sets are sufficient to generate fully resolved phylogenetic trees, even in the presence of horizontal gene transfer.

Indexed as

GenomicsPhylogenycographgene treeorthologyparalogyspecies tree

Identifiers

PMID25646426
PMCPMC4343152

What OpenQuestion holds

Textmetadata
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.