A new, fast algorithm for detecting protein coevolution using maximum compatible cliques
2011

A Fast Algorithm for Detecting Protein Coevolution

Sample size: 17969452 publication Evidence: high

Author Information

Author(s): Rodionov Alex, Bezginov Alexandr, Rose Jonathan, Tillier Elisabeth RM

Primary Institution: University of Toronto

Hypothesis

Can we develop a faster algorithm for detecting protein coevolution that maintains accuracy?

Conclusion

The new MMMvII algorithm allows for much faster analyses of protein coevolution while maintaining comparable accuracy to the original method.

Supporting Evidence

  • MMMvII achieved more than 600× speedup compared to the original algorithm.
  • The new algorithm allows for the analysis of larger datasets.
  • MMMvII retains the original intent of the MMM algorithm while improving speed.

Takeaway

The researchers created a new computer program that helps scientists find out how proteins evolve together much faster than before.

Methodology

The study involved developing the MMMvII algorithm, which reformulates the problem of finding maximum common submatrices into a graph-theoretical problem of finding maximum similar cliques.

Limitations

The biological reasonableness of the clustering approach for predicting protein-protein interactions has not yet been validated.

Digital Object Identifier (DOI)

10.1186/1748-7188-6-17

Want to read the original?

Access the complete publication on the publisher's website

View Original Publication