No retraction, correction or concern found when last checked on Nov 3, 2026.
Orthology prediction methods: A quality assessment using curated protein families
Kalliopi Trachana, Tomas A. Larsson, Sean Powell and 4 more
BioEssays · 2011
Abstract
The increasing number of sequenced genomes has prompted the development of several automated orthology prediction methods. Tests to evaluate the accuracy of predictions and to explore biases caused by biological and technical factors are therefore required. We used 70 manually curated families to analyze the performance of five public methods in Metazoa. We analyzed the strengths and weaknesses of the methods and quantified the impact of biological and technical challenges. From the latter part of the analysis, genome annotation emerged as the largest single influencer, affecting up to 30% of the performance. Generally, most methods did well in assigning orthologous group but they failed to assign the exact number of genes for half of the groups. The publicly available benchmark set ( http://eggnog.embl.de/orthobench/ ) should facilitate the improvement of current orthology assignment protocols, which is of utmost importance for many fields of biology and should be tackled by a broad scientific community.
Shown for reading. Its publisher allows quoting it, not republishing it.
References 60
- 1.
- 2.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 3.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 4.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 5.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 6.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 7.
- 8.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 9.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 10.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 11.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 12.
- 13.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 14.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 15.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 16.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 17.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 18.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 19.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 20.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 21.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 22.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 23.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 24.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 25.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 26.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 27.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 28.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 29.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 30.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 31.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 32.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 33.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 34.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 35.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 36.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 37.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 38.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 39.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 40.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 41.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 42.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 43.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 44.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 45.
- 46.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 47.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 48.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 49.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 50.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 51.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 52.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 53.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 54.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 55.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 56.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 57.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 58.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 59.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
- 60.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
Cited by papers we hold 12
- OrthoDB v11: annotation of orthologs in the widest sampling of organismal diversity · 2022No notice
- OrthoDB in 2020: evolutionary and functional annotations of orthologs · 2020No notice
- OrthoFinder: phylogenetic orthology inference for comparative genomics · 2019No notice
- OrthoDB v10: sampling the diversity of animal, plant, fungal, protist, bacterial and viral genomes for evolutionary and functional annotations of orthologs · 2018No notice
- panX: pan-genome analysis and exploration · 2017No notice
- Archaeal Clusters of Orthologous Genes (arCOGs): An Update and Application for Analysis of Shared Features between Thermococcales, Methanococcales, and Methanobacteriales · 2015No notice
- eggNOG 4.5: a hierarchical orthology framework with improved functional annotations for eukaryotic, prokaryotic and viral sequences · 2015No notice
- OrthoFinder: solving fundamental biases in whole genome comparisons dramatically improves orthogroup inference accuracy · 2015No notice
- OrthoDB v8: update of the hierarchical catalog of orthologs and the underlying free software · 2014No notice
- Analysis of 41 plant genomes supports a wave of successful genome duplications in association with the Cretaceous–Paleogene boundary · 2014No notice
- Inferring Hierarchical Orthologous Groups from Orthologous Gene Pairs · 2013No notice
- Updated clusters of orthologous genes for Archaea: a complex ancestor of the Archaea and the byways of horizontal gene transfer · 2012No notice
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.