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

Orthologous Matrix (OMA) algorithm 2.0: more robust to asymmetric evolutionary rates and more scalable hierarchical orthologous group inference

Open access
Train, Clément-Marie, Glover, Natasha M, Gonnet, Gaston H, Altenhoff, Adrian M, Dessimoz, Christophe·2017·Bioinformatics

Abstract

Motivation: Accurate orthology inference is a fundamental step in many phylogenetics and comparative analysis. Many methods have been proposed, including OMA (Orthologous MAtrix). Yet substantial challenges remain, in particular in coping with fragmented genes or genes evolving at different rates after duplication, and in scaling to large datasets. With more and more genomes available, it is necessary to improve the scalability and robustness of orthology inference methods. Results: We present improvements in the OMA algorithm: (i) refining the pairwise orthology inference step to account for same-species paralogs evolving at different rates, and (ii) minimizing errors in the pairwise orthology verification step by testing the consistency of pairwise distance estimates, which can be problematic in the presence of fragmentary sequences. In addition we introduce a more scalable procedure for hierarchical orthologous group (HOG) clustering, which are several orders of magnitude faster on large datasets. Using the Quest for Orthologs consortium orthology benchmark service, we show that these changes translate into substantial improvement on multiple empirical datasets. Availability and Implementation: This new OMA 2.0 algorithm is used in the OMA database (http://omabrowser.org) from the March 2017 release onwards, and can be run on custom genomes using OMA standalone version 2.0 and above (http://omabrowser.org/standalone).

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/btx229

Cites

2 of 2 references verified0 citation errors · 0 not checkable

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?

  • Graph-based methods cluster genes into pairs or groups of orthologs based on pairwise sequence similarity such as reciprocal best alignment hits.

    “Graph-based methods cluster genes into pairs or groups of orthologs based on pairwise sequence similarity such as (reciprocal) best alignment hits (8–12).”

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

Flagged first, then by citations

Research works printed but not linked: 27

  1. Altenhoff A.M. et al (2013) Inferring hierarchical orthologous groups from orthologous gene pairs. PLoS One, 8, e53786. 23342000 PMC3544860
  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. et al (2015) The OMA orthology database in 2015: function predictions, better plant support, synteny view and other improvements. Nucleic Acids Res., 43, D240– D249. 25399418 PMC4383958
  4. Altenhoff A.M., Dessimoz C. (2009) Phylogenetic and functional assessment of orthologs inference projects and methods. PLoS Comput. Biol., 5, e1000262. 19148271 PMC2612752
  5. Ballesteros J.A., Hormiga G. (2016) A new orthology assessment method for phylogenomic data: unrooted phylogenetic orthology. Mol. Biol. Evol., 33, 2481. 27539986
  6. Boeckmann B. et al (2011) Conceptual framework and pilot study to benchmark phylogenomic databases based on reference gene trees. Brief. Bioinformatics, 12, 423– 435. 21737420 PMC3178055
  7. Boeckmann B. et al (2015) Quest for orthologs entails quest for tree of life: in search of the gene stream. Genome Biol. Evol., 7, 1988– 1999. 26133389 PMC4524488
  8. Boussau B. et al (2012) Genome-scale coestimation of species and gene trees. Genome Res., 23, 323– 330. 23132911 PMC3561873
  9. Cormen T.H. (2009) Introduction to Algorithms MIT Press.
  10. Dalquen D.A., Dessimoz C. (2013) Bidirectional best hits miss many orthologs in duplication-rich clades such as plants and animals. Genome Biol. Evol., 5, 1800– 1806. 24013106 PMC3814191
  11. Dessimoz C. et al (2006a) Detecting non-orthology in the COGs database and other approaches grouping orthologs using genome-specific best hits. Nucleic Acids Res., 34, 3309– 3316. 16835308 PMC1500873
  12. Dessimoz C. et al (2006b) Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences. BMC Bioinformatics, 7, 529. 17147817 PMC1762028
  13. Dessimoz C. et al (2005) OMA, A comprehensive, automated project for the identification of orthologs from complete genome data: introduction and first achievements In: McLysaght A., Huson D.H. (eds.) RECOMB 2005 Workshop on Comparative Genomics. Springer Berlin Heidelberg, pp. 61– 72.
  14. Durand D. et al (2006) A hybrid micro-macroevolutionary approach to gene tree reconstruction. J. Comput. Biol., 13, 320– 335. 16597243
  15. Fitch W.M. (1970) Distinguishing homologous from analogous proteins. Syst. Zool., 19, 99– 113. 5449325
  16. Kriventseva E.V. et al (2008) OrthoDB: the hierarchical catalog of eukaryotic orthologs. Nucleic Acids Res., 36, D271– D275. 17947323 PMC2238902
  17. Lafond M., El-Mabrouk N. (2014) Orthology and paralogy constraints: satisfiability and consistency. BMC Genomics, 15(Suppl 6), S12. PMC4240720 25572629
  18. Li L. et al (2003) OrthoMCL: identification of ortholog groups for eukaryotic genomes. Genome Res., 13, 2178– 2189. 12952885 PMC403725
  19. Linard B. et al (2011) OrthoInspector: comprehensive orthology analysis and visual exploration. BMC Bioinformatics, 12, 11. 21219603 PMC3024942
  20. Overbeek R. et al (1999) The use of gene clusters to infer functional coupling. Proc. Natl. Acad. Sci. USA, 96, 2896– 2901. 10077608 PMC15866
  21. Remm M. et al (2001) Automatic clustering of orthologs and in-paralogs from pairwise species comparisons. J. Mol. Biol., 314, 1041– 1052. 11743721
  22. Roth A.C.J. et al (2008) Algorithm of OMA for large-scale orthology inference. BMC Bioinformatics, 9, 518. 19055798 PMC2639434
  23. Schreiber F., Sonnhammer E.L.L. (2013) Hieranoid: hierarchical orthology inference. J. Mol. Biol., 425, 2072– 2081. 23485417
  24. Smith T.F., Waterman M.S. (1981) Identification of common molecular subsequences. J. Mol. Biol., 147, 195– 197. 7265238
  25. Tatusov R.L. et al (1997) A genomic perspective on protein families. Science, 278, 631– 637. 9381173
  26. Trachana K. et al (2011) Orthology prediction methods: a quality assessment using curated protein families. Bioessays, 33, 769– 780. 21853451 PMC3193375
  27. Vilella A.J. et al (2008) EnsemblCompara GeneTrees: Complete, duplication-aware phylogenetic trees in vertebrates. Genome Res., 19, 327– 335. 19029536 PMC2652215

Cited by

Sorted by citations

Authors
Train, C.-M., Glover, N. M., Gonnet, G. H., Altenhoff, A. M., & Dessimoz, C.
Affiliations
  • SIB Swiss Institute of Bioinformatics (CH)
  • Department of Computer Science, ETH Zurich, Zurich, Switzerland
Corresponding author
  • Altenhoff, Adrian M
  • Dessimoz, Christophe
Venue
Bioinformatics
Published
2017-07-12
Volume
33
Issue
14
Pages
i75-i82
ISSN
  • 1367-4803 (ISSN-L)
  • 1367-4811
OpenAlex
W2734735318
Cited by
96
References
2
Citations by year
2026: 3 · 2025: 5 · 2024: 8 · 2023: 7 · 2022: 16 · 2021: 11 · 2020: 14 · 2019: 18 · 2018: 13 · 2017: 1
FWCI
5.01
Type
journal article
Language
en
Open access
Locations
  • Bioinformatics (publishedVersion, cc-by-nc)
  • PubMed Central (publishedVersion, cc-by-nc)
  • PubMed (publishedVersion)
  • SERVAL (Université de Lausanne) (publishedVersion, cc-by-nc)
  • Repository for Publications and Research Data (ETH Zurich) (publishedVersion, cc-by-nc)
  • RERO DOC (Universität Bern) (submittedVersion)
  • IRIS (submittedVersion, cc-by-nc)
  • UCL Discovery (University College London) (submittedVersion)
  • ETH Zürich Research Collection
Funders
  • National Science Foundation
  • University College London
  • Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung (150654, BB/M015009/1)
  • Swiss Institute of Bioinformatics
  • Biotechnology and Biological Sciences Research Council (BB/M015009/1)
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, paralogs, gene duplication
MeSH terms
Algorithms, Animals, Humans, Mammals, Phylogeny, Software, Evolution, Molecular, Genomics, Mutation Rate

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