Using OrthoMCL to assign proteins to OrthoMCL-DB groups or to cluster proteomes into new ortholog groups
By S. Fischer, Brian P. Brunk, Feng Chen, Xin Gao, O. Harb, John Iodice, D. Shanmugam, David S. Roos, Christian J. Stoeckert Jr.. Current Protocols in Bioinformatics, 2011
450 citations recorded by the source corpus.
OrthoMCL is an algorithm for grouping proteins into ortholog groups based on their sequence similarity. OrthoMCL-DB is a public database that allows users to browse and view ortholog groups that were pre-computed using the OrthoMCL algorithm. Version 4 of this database contained 116,536 ortholog groups clustered from 1,270,853 proteins obtained from 88 eukaryotic genomes, 16 archaeal genomes and 34 bacterial genomes. Future versions of OrthoMCL-DB will include more proteomes as more genomes are sequenced. Here, we describe how you can group your proteins of interest into ortholog clusters using two different means provided by the OrthoMCL system. The OrthoMCL-DB website has a tool for uploading and grouping a set of protein sequences, typically representing a proteome. This method maps the uploaded proteins to existing groups in OrthoMCL-DB. Alternatively, if you have proteins from a set of genomes that need to be grouped, you can download, install and run the standalone OrthoMCL software.
Subfields: Molecular Biology
View Paper: https://www.semanticscholar.org/paper/08d48e3a0954bb401acd35e89004aadf0d51c60d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Molecular Biology
- Mosè Manni
- E. Zdobnov
- Felipe A. Simão
- D. Kuznetsov
- Fredrik Tegenfeldt
- Evgenia V. Kriventseva
- Mark Borodovsky
- Tomás Bruna
Citations in the corpus
- OrthoDB v10: sampling the diversity of animal, plant, fungal, protist, bacterial and viral genomes for evolutionary and functional annotations of orthologs (2018, methodology): “The latest adjustments to the OrthoDB algorithm include: (i) optimizations of the underlying data structures to reduce the memory usage, enabling us to increase the number of organisms covered, (ii) use of MMseqs2 (27) for homology searches to speed up the computations growing as square of the total”