The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Automatic clustering of orthologs and inparalogs shared by multiple proteomes
Abstract
Motivation: The complete sequencing of many genomes has made it possible to identify orthologous genes descending from a common ancestor. However, reconstruction of evolutionary history over long time periods faces many challenges due to gene duplications and losses. Identification of orthologous groups shared by multiple proteomes therefore becomes a clustering problem in which an optimal compromise between conflicting evidences needs to be found. Results: Here we present a new proteome-scale analysis program called MultiParanoid that can automatically find orthology relationships between proteins in multiple proteomes. The software is an extension of the InParanoid program that identifies orthologs and inparalogs in pairwise proteome comparisons. MultiParanoid applies a clustering algorithm to merge multiple pairwise ortholog groups from InParanoid into multi-species ortholog groups. To avoid outparalogs in the same cluster, MultiParanoid only combines species that share the same last ancestor. To validate the clustering technique, we compared the results to a reference set obtained by manual phylogenetic analysis. We further compared the results to ortholog groups in KOGs and OrthoMCL, which revealed that MultiParanoid produces substantially fewer outparalogs than these resources. Availability: MultiParanoid is a freely available standalone program that enables efficient orthology analysis much needed in the post-genomic era. A web-based service providing access to the original datasets, the resulting groups of orthologs, and the source code of the program can be found at . Contact: Erik.Sonnhammer@sbc.su.se Supplementary information:
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
OrthoMCL: Identification of Ortholog Groups for Eukaryotic Genomes
Li, L., Stoeckert, C. J., & Roos, D. S. (2003) · Genome Research · doi:10.1101/gr.1224503 · Cited by 5,707
Comparative Genomics of the Eukaryotes
Rubin, G. M., Yandell, M. D., Wortman, J. R., Gabor, G. L., Miklos, Nelson, C. R., Hariharan, I. K., Fortini, M. E., Li, P. W., Apweiler, R., et al. (2000) · Science · doi:10.1126/science.287.5461.2204 · Cited by 1,698
Mushegian, A. R., Garey, J. R., Martin, J., & Liu, L. X. (1998) · Genome Research · doi:10.1101/gr.8.6.590 · Cited by 164 · cited 1×
“The BLAST approach can be substantially improved by only accepting reciprocally best matching protein pairs as orthologs (Mushegian et al. , 1998).”
Method
Cited by
Emms, D. M., & Kelly, S. (2015) · Genome Biology · doi:10.1186/s13059-015-0721-2 · Cited by 3,408
The sequence and de novo assembly of the giant panda genome
Li, R., Fan, W., Tian, G., Zhu, H., He, L., Cai, J., Huang, Q., Cai, Q., Li, B., Bai, Y., et al. (2010) · Nature · doi:10.1038/nature08696 · Cited by 1,180
Proteinortho: Detection of (Co-)orthologs in large-scale analysis
Lechner, M., Findeiß, S., Steiner, L., Marz, M., Stadler, P. F., & Prohaska, S. J. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-124 · Cited by 1,221
An integrative approach to ortholog prediction for disease-focused and other functional studies
Hu, Y., Flockhart, I., Vinayagam, A., Bergwitz, C., Berger, B., Perrimon, N., & Mohr, S. E. (2011) · BMC Bioinformatics · doi:10.1186/1471-2105-12-357 · Cited by 848
eggNOG: automated construction and annotation of orthologous groups of genes
Jensen, L. J., Julien, P., Kuhn, M., von Mering, C., Muller, J., Doerks, T., & Bork, P. (2007) · Nucleic Acids Research · doi:10.1093/nar/gkm796 · Cited by 547
Metadata
- Authors
- Alexeyenko, A., Tamas, I., Liu, G., & Sonnhammer, E. L. L.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2006-07-15
- Volume
- 22
- Issue
- 14
- Pages
- e9-e15
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2112884978
- Cited by
- 248
- References
- 3
- FWCI
- 7.12
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Automatic clustering of orthologs and inparalogs shared by multiple proteomes. https://app.cochat.ai/papers/10.1093/bioinformatics/btl213
- The paper
- Alexeyenko, A., Tamas, I., Liu, G., & Sonnhammer, E. L. L. (2006). Automatic clustering of orthologs and inparalogs shared by multiple proteomes. Bioinformatics. https://doi.org/10.1093/bioinformatics/btl213
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.