Related Experiment Video
Updated: Jun 1, 2026

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
Published on: October 19, 2021
A new, fast algorithm for detecting protein coevolution using maximum compatible cliques
Alex Rodionov1, Alexandr Bezginov, Jonathan Rose
1The Edward S, Rogers Sr, Department of Electrical and Computer Engineering, University of Toronto, Toronto, Canada. arod@eecg.toronto.edu.
Background:
The MatrixMatchMaker algorithm was recently introduced to detect the similarity between phylogenetic trees and thus the coevolution between proteins. MMM finds the largest common submatrices between pairs of phylogenetic distance matrices, and has numerous advantages over existing methods of coevolution detection. However, these advantages came at the cost of a very long execution time.
Results:
In this paper, we show that the problem of finding the maximum submatrix reduces to a multiple maximum clique subproblem on a graph of protein pairs. This allowed us to develop a new algorithm and program implementation, MMMvII, which achieved more than 600× speedup with comparable accuracy to the original MMM.
Conclusions:
MMMvII will thus allow for more more extensive and intricate analyses of coevolution.
Availability:
An implementation of the MMMvII algorithm is available at: http://www.uhnresearch.ca/labs/tillier/MMMWEBvII/MMMWEBvII.php.
Insights
The MatrixMatchMaker algorithm (MMM) detects protein coevolution by analyzing phylogenetic trees. A new version, MMMvII, significantly speeds up this process, enabling more detailed coevolutionary analyses.
Area of Science:
- Bioinformatics
- Computational Biology
- Evolutionary Biology
Background:
- The MatrixMatchMaker (MMM) algorithm was developed to detect similarities between phylogenetic trees and infer protein coevolution.
- MMM identifies common submatrices within phylogenetic distance matrices, offering advantages over prior coevolution detection methods.
- The original MMM algorithm suffered from excessively long execution times, limiting its practical application.
Purpose of the Study:
- To address the computational limitations of the original MatrixMatchMaker algorithm.
- To develop a faster and more efficient method for detecting protein coevolution.
- To enable more extensive and intricate coevolutionary analyses.
Main Methods:
- The study reframes the maximum submatrix problem as a multiple maximum clique subproblem on a protein pair graph.
- A novel algorithm and program implementation, MMMvII, was developed based on this new approach.
- The performance of MMMvII was evaluated against the original MMM algorithm.
Main Results:
- The MMMvII algorithm achieved a speedup of over 600 times compared to the original MMM.
- MMMvII demonstrated comparable accuracy to the original MMM in detecting coevolution.
- The computational problem was successfully reduced to a multiple maximum clique subproblem.
Conclusions:
- MMMvII significantly enhances the efficiency of coevolution detection.
- The improved speed allows for more comprehensive and complex analyses of protein coevolution.
- MMMvII facilitates deeper insights into evolutionary relationships and protein function.
More Related Videos
07:08Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
Published on: July 14, 2015
08:38Genome-wide Protein-protein Interaction Screening by Protein-fragment Complementation Assay (PCA) in Living Cells
Published on: March 3, 2015
Related Concept Videos
Protein Complexes with Interchangeable Parts
The SCF ubiquitin ligase is a protein complex of five individual proteins. This complex attaches ubiquitin to other target proteins to mark them for degradation. In order to...
Protein Complexes with Interchangeable Parts
The SCF ubiquitin ligase is a protein complex of five individual proteins. This complex attaches ubiquitin to other target proteins to mark them for degradation. In order to...
Conservation of Protein Domains Over Different Proteins
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...
Conservation of Protein Domains
A limited set of protein domains often duplicate and recombine during evolution. These domains can be organized in different combinations to form...
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
Protein Networks
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...