Evidence map›Paper›PMID 35561192›Full record

ArticleBioinformatics (Oxford, England)2022

InParanoid-DIAMOND: faster orthology analysis with the InParanoid algorithm.

Emma Persson, Erik L L Sonnhammer

Abstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 20 papers.

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

20 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Review
  5. Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Article
  11. Article
  12. Article
  13. Article
  14. Article
  15. RpoS-Regulated Genes and Phenotypes in the Phytopathogenic BacteriumInternational journal of molecular sciences · 2023
    Article
  16. Review
  17. Article
  18. RoseAP: an analytical platform for gene function ofFrontiers in plant science · 2023
    Article
  19. PlantCHRs: A comprehensive database of plant chromatin remodeling factors.Computational and structural biotechnology journal · 2023
    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

2 authors.

Emma PerssonDepartment of Biochemistry and Biophysics, Stockholm University, Science for Life Laboratory, 17121 Solna, Sweden.ORCID 0000-0003-0532-8251
Erik L L SonnhammerDepartment of Biochemistry and Biophysics, Stockholm University, Science for Life Laboratory, 17121 Solna, Sweden.ORCID 0000-0002-9015-5588

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

summaryPredicting orthologs, genes in different species having shared ancestry, is an important task in bioinformatics. Orthology prediction tools are required to make accurate and fast predictions, in order to analyze large amounts of data within a feasible time frame. InParanoid is a well-known algorithm for orthology analysis, shown to perform well in benchmarks, but having the major limitation of long runtimes on large datasets. Here, we present an update to the InParanoid algorithm that can use the faster tool DIAMOND instead of BLAST for the homolog search step. We show that it reduces the runtime by 94%, while still obtaining similar performance in the Quest for Orthologs benchmark. AVAILABILITY AND IMPLEMENTATION: The source code is available at (https://bitbucket.org/sonnhammergroup/inparanoid). SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Indexed as

AlgorithmsSoftware

Identifiers

PMID35561192
PMCPMC9113356

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.