Evidence map›Paper›PMID 25137074›Full record

ArticlePloS one2014

Orthology detection combining clustering and synteny for very large datasets.

Marcus Lechner, Maribel Hernandez-Rosales, Daniel Doerr, Nicolas Wieseke, Annelyse Thévenin, Jens Stoye, Roland K Hartmann, Sonja J Prohaska, Peter F Stadler

Abstract read
In one paragraph

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

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

48 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Efficient gene orthology inference via large-scale rearrangements.Algorithms for molecular biology : AMB · 2023
    Article
  6. Article
  7. Article
  8. Elucidating the Mesocarp Drupe Transcriptome of Açai (International journal of molecular sciences · 2023
    Article
  9. Article
  10. Article
  11. Article
  12. Heuristic algorithms for best match graph editing.Algorithms for molecular biology : AMB · 2021
    Article
  13. Article
  14. Article
  15. Article
  16. Article
  17. Article
  18. Article
  19. Reciprocal best match graphs.Journal of mathematical biology · 2020
    Article
  20. Reconstruction of time-consistent species trees.Algorithms for molecular biology : AMB · 2020
    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

9 authors.

Marcus LechnerInstitut für Pharmazeutische Chemie, Philipps-Universität Marburg, Marburg, Germany.
Maribel Hernandez-RosalesBioinformatics Group, Department of Computer Science, Universität Leipzig, Leipzig, Germany; Interdisciplinary Center for Bioinformatics, Universität Leipzig, Leipzig, Germany; Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany; Departamento de Ciência da Computação, Instituto de Ciências Exatas, Universidade de Brasília, Brasília, Brasil.
Daniel DoerrGenome Informatics, Faculty of Technology, Bielefeld University, Bielefeld, Germany; Institute for Bioinformatics, Center for Biotechnology, Bielefeld University, Bielefeld, Germany.
Nicolas WiesekeFaculty of Mathematics and Computer Science University of Leipzig, Leipzig, Germany.
Annelyse ThéveninGenome Informatics, Faculty of Technology, Bielefeld University, Bielefeld, Germany; Institute for Bioinformatics, Center for Biotechnology, Bielefeld University, Bielefeld, Germany.
Jens StoyeGenome Informatics, Faculty of Technology, Bielefeld University, Bielefeld, Germany; Institute for Bioinformatics, Center for Biotechnology, Bielefeld University, Bielefeld, Germany.
Roland K HartmannInstitut für Pharmazeutische Chemie, Philipps-Universität Marburg, Marburg, Germany.
Sonja J ProhaskaComputational EvoDevo Group, Department of Computer Science, Universität Leipzig, Leipzig, Germany.
Peter F StadlerBioinformatics Group, Department of Computer Science, Universität Leipzig, Leipzig, Germany; Interdisciplinary Center for Bioinformatics, Universität Leipzig, Leipzig, Germany; Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany; Institute for Theoretical Chemistry, University of Vienna, Vienna, Austria; Center for non-coding RNA in Technology and Health, University of Copenhagen, Frederiksberg, Denmark; The Santa Fe Institute, Santa Fe, New Mexico, United States of America; RNomics Group, Fraunhofer Institut for Cell Therapy and Immunology, Leipzig, Germany.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The elucidation of orthology relationships is an important step both in gene function prediction as well as towards understanding patterns of sequence evolution. Orthology assignments are usually derived directly from sequence similarities for large data because more exact approaches exhibit too high computational costs. Here we present PoFF, an extension for the standalone tool Proteinortho, which enhances orthology detection by combining clustering, sequence similarity, and synteny. In the course of this work, FFAdj-MCS, a heuristic that assesses pairwise gene order using adjacencies (a similarity measure related to the breakpoint distance) was adapted to support multiple linear chromosomes and extended to detect duplicated regions. PoFF largely reduces the number of false positives and enables more fine-grained predictions than purely similarity-based approaches. The extension maintains the low memory requirements and the efficient concurrency options of its basis Proteinortho, making the software applicable to very large datasets.

Indexed as

Models, GeneticSoftwareSyntenyBacterial ProteinsCluster AnalysisComputer SimulationDatasets as TopicGenes, BacterialBacterial Proteins

Identifiers

PMID25137074
PMCPMC4138177

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.