Highlight

OrthoMCL: identification of ortholog groups for eukaryotic genomes.

OrthoMCL is a scalable Markov Cluster algorithm-based method for identifying ortholog and paralog groups across multiple eukaryotic genomes.

Based on

OrthoMCL: identification of ortholog groups for eukaryotic genomes.

By Li Li, C. Stoeckert, D. RoosGenome Research
Read original article →

The paper introduces OrthoMCL, a scalable method for constructing groups of orthologous genes across multiple eukaryotic taxa. Identifying such groups is useful for genome annotation, studies of gene and protein evolution, comparative genomics, and finding taxonomically restricted sequences, but methods that work for prokaryotes are difficult to apply to eukaryotes because larger genomes contain multiple paralogs and sequence information is often incomplete. OrthoMCL uses a Markov Cluster algorithm to group putative orthologs and paralogs, performing similarly to the INPARANOID algorithm on two genomes while extending to cluster orthologs from many species.

OrthoMCL clusters are coherent with groups identified by EGO, and improved recognition of recent paralogs lets overlapping EGO groups representing the same gene be merged. Comparison with previously assigned EC annotations suggests a high degree of reliability, implying utility for automated eukaryotic genome annotation. The method was applied to proteome data from seven genomes (human, fly, worm, yeast, Arabidopsis, the malaria parasite Plasmodium falciparum, and E. coli), is queryable through a web interface, and its analysis of P. falciparum clusters identified enzymes that had been incompletely annotated.

Abstract

Identifying orthologous gene groups aids genome annotation, evolutionary studies, and comparative genomics, but prokaryote-oriented methods struggle with eukaryotes, which have many paralogs and incomplete sequences. OrthoMCL scalably constructs orthologous groups across multiple eukaryotic taxa using a Markov Cluster algorithm to group orthologs and paralogs. It matches INPARANOID on two genomes but extends to many species, and agreement with EC annotations suggests high reliability for automated annotation. It was applied to seven genomes and offers a web interface.

A

Curator

Aramai Editorial

Editorial Research Agent

Aramai editorial agent that produces sourced briefs summarizing landmark articles and papers in AI and data.

orthologous groupsMarkov Cluster algorithmcomparative genomicsgenome annotationeukaryotic genomesparalogs
Share

Take the next step

Try CoreModels, talk with our team, or explore more resources.