Cited by 134Genomics and Phylogenetic StudiesBioinformatics and Genomic NetworksChromosomal and Genetic Variations

SonicParanoid: fast, accurate and easy orthology inference

Open access
Cosentino, Salvatore, Iwasaki, Wataru·2019·Bioinformatics

Abstract

Motivation: Orthology inference constitutes a common base of many genome-based studies, as a pre-requisite for annotating new genomes, finding target genes for biotechnological applications and revealing the evolutionary history of life. Although its importance keeps rising with the ever-growing number of sequenced genomes, existing tools are computationally demanding and difficult to employ. Results: Here, we present SonicParanoid, which is faster than, but comparably accurate to, the well-established tools with a balanced precision-recall trade-off. Furthermore, SonicParanoid substantially relieves the difficulties of orthology inference for those who need to construct and maintain their own genomic datasets. Availability and implementation: SonicParanoid is available with a GNU GPLv3 license on the Python Package Index and BitBucket. Documentation is available at http://iwasakilab.bs.s.u-tokyo.ac.jp/sonicparanoid. Supplementary information: Supplementary data are available at Bioinformatics online.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1093/bioinformatics/bty631

Cites

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Heuristic analysis of pairwise sequence similarity scores is based on the premise that higher scoring sequence pairs are likely to have diverged more recently than lower scoring sequence pairs.

    “The central premise underlying their use is that higher scoring sequence pairs are likely to have diverged more recently than lower scoring sequence pairs.”

    From OrthoFinder: phylogenetic orthology inference for comparative genomics (2019) · cites this paper as [12]

    The Materials and methods section describes SonicParanoid’s sequence-scoring function and alignment thresholds, but does not say that higher-scoring pairs diverged more recently. Searches for the quoted premise and for a relationship between similarity scores and divergence time found no passage addressing that relationship; no page numbers are available in our copy. (LLM, conf=0.72)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

No references could be resolved yet.

Research works printed but not linked: 18

  1. Alexeyenko A. et al (2006) Automatic clustering of orthologs and inparalogs shared by multiple proteomes. Bioinformatics, 22, e9– 15. 16873526
  2. Altenhoff A.M. et al (2016) Standardized benchmarking in the quest for orthologs. Nat. Methods, 13, 425– 430. 27043882 PMC4827703
  3. Altenhoff A.M., Dessimoz C. (2012) Inferring orthology and paralogy. Methods Mol. Biol., 855, 259– 279. 22407712
  4. Altschul S.F. et al (1997) Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res., 25, 3389– 3402. 9254694 PMC146917
  5. Buchfink B. et al (2015) Fast and sensitive protein alignment using DIAMOND. Nat. Methods, 12, 59– 60. 25402007
  6. Camacho C. et al (2009) BLAST+: architecture and applications. BMC Bioinformatics, 10, 421. 20003500 PMC2803857
  7. Chen F. et al (2007) Assessing performance of orthology detection strategies applied to eukaryotic genomes. PLoS One, 2, e383. 17440619 PMC1849888
  8. Cochrane G. et al (2016) The International Nucleotide Sequence Database Collaboration. Nucleic Acids Res., 44, D48– D50. 26657633 PMC4702924
  9. Emms D.M., Kelly S. (2015) OrthoFinder: solving fundamental biases in whole genome comparisons dramatically improves orthogroup inference accuracy. Genome Biol., 16, 157. 26243257 PMC4531804
  10. Gabaldón T. et al (2009) Joining forces in the quest for orthologs. Genome Biol., 10, 403. 19785718 PMC2768974
  11. Kaduk M., Sonnhammer E. (2017) Improved orthology inference with Hieranoid 2. Bioinformatics, 33, 1154– 1159. 28096085
  12. Lechner M. et al (2011) Proteinortho: detection of (co-)orthologs in large-scale analysis. BMC Bioinformatics, 12, 124. 21526987 PMC3114741
  13. Li L. et al (2003) OrthoMCL: identification of ortholog groups for eukaryotic genomes. Genome Res., 13, 2178– 2189. 12952885 PMC403725
  14. Mi H. et al (2017) PANTHER version 11: expanded annotation data from Gene Ontology and Reactome pathways, and data analysis tool enhancements. Nucleic Acids Res., 45, D183– D189. 27899595 PMC5210595
  15. Remm M. et al (2001) Automatic clustering of orthologs and in-paralogs from pairwise species comparisons. J. Mol. Biol., 314, 1041– 1052. 11743721
  16. Sonnhammer E.L.L., Östlund G. (2015) InParanoid 8: orthology analysis between 273 proteomes, mostly eukaryotic. Nucleic Acids Res., 43, D234– D239. 25429972 PMC4383983
  17. Steinegger M., Söding J. (2017) MMseqs2 enables sensitive protein sequence searching for the analysis of massive data sets. Nat. Biotechnol., 35, 1026– 1028. 29035372
  18. Train C.-M. et al (2017) Orthologous Matrix (OMA) algorithm 2.0: more robust to asymmetric evolutionary rates and more scalable hierarchical orthologous group inference. Bioinformatics, 33, i75– i82. 28881964 PMC5870696

Authors
Cosentino, S., & Iwasaki, W.
Affiliations
  • The University of Tokyo (JP)
  • Atmosphere and Ocean Research Institute, The University of Tokyo (JP)
Corresponding author
  • Cosentino, Salvatore
  • Iwasaki, Wataru
Venue
Bioinformatics
Published
2018-07-19
Volume
35
Issue
1
Pages
149-151
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W2882992890
Cited by
134
References
0
Citations by year
2026: 9 · 2025: 15 · 2024: 25 · 2023: 21 · 2022: 27 · 2021: 16 · 2020: 17 · 2019: 4
FWCI
3.23
Type
journal article
Language
en
Open access
Locations
  • Bioinformatics (publishedVersion, cc-by-nc)
  • Europe PMC (PubMed Central) (publishedVersion, cc-by-nc)
  • PubMed Central (publishedVersion, cc-by-nc)
  • PubMed (publishedVersion)
Funders
Japanese Society for the Promotion of Scienc (16H06154, 16H06279, 17H05834)
Topics
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Genomics and Phylogenetic Studies
  • Life Sciences › Biochemistry, Genetics and Molecular Biology › Molecular Biology › Bioinformatics and Genomic Networks
  • Life Sciences › Agricultural and Biological Sciences › Plant Science › Chromosomal and Genetic Variations
Keywords
orthology inference, genome annotation, precision-recall trade-off, comparative genomics, Python
MeSH terms
Software, Genome, Computational Biology, Genomics, Databases, Genetic

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review