Related Experiment Video
Updated: Jan 1, 2026

Protein WISDOM: A Workbench for In silico De novo Design of BioMolecules
Published on: July 25, 2013
Minimization-Aware Recursive K*: A Novel, Provable Algorithm that Accelerates Ensemble-Based Protein Design and
Jonathan D Jou1, Graham T Holt1,2, Anna U Lowegard1,2
1Department of Computer Science, Duke University, Durham, North Carolina.
A new protein design algorithm, Minimization-Aware Recursive K* (MARK*), significantly improves computational efficiency and accuracy. MARK* accelerates existing protein design methods and enables new analyses of protein energy landscapes.
Area of Science:
- Computational biology and biophysics
- Protein engineering and design
- Bioinformatics and computational methods
Background:
- Accurate protein modeling requires accounting for sidechain flexibility and conformational ensembles.
- Existing algorithms like iMinDEE-A*-K* approximate protein partition functions but struggle with conformational energy correlations.
- The inability to exploit the correlation between similar conformations and similar energies limits the efficiency of current protein design tools.
Purpose of the Study:
- To introduce a novel algorithm, Minimization-Aware Recursive K* (MARK*), that addresses the limitations of previous protein design methods.
- To improve the efficiency and accuracy of approximating protein partition functions and energy landscapes.
- To enable new analyses of protein conformational changes and binding events.
Main Methods:
- Development of Minimization-Aware Enumeration and Recursive K* concepts.
- Integration of these concepts into the MARK* algorithm.
- Comparison of MARK* against iMinDEE-A*-K* using the Branch and Bound over K* (BBK*) algorithm on 200 design problems.
- Application of MARK* to analyze the energy landscape changes of an HIV-1 capsid protein.
Main Results:
- MARK* enumerates and minimizes significantly fewer conformations compared to the state-of-the-art.
- MARK* achieves up to two orders of magnitude faster performance than iMinDEE-A*-K*.
- MARK* provably approximates protein energy landscapes, a capability not previously achieved.
- Analysis of HIV-1 capsid protein reveals changes in conformational entropy upon binding.
Conclusions:
- MARK* represents a significant advancement in protein design algorithms, offering substantial speedups and improved accuracy.
- The algorithm's ability to approximate energy landscapes opens new avenues for understanding protein behavior.
- MARK* enhances existing protein design workflows and provides novel analytical capabilities for molecular interactions.
More Related Videos
Related Concept Videos
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation
On...
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...
Conserved Binding Sites
Binding sites are often located in large pockets, and if their location on a protein’s surface is unknown, it can be predicted using various approaches. The energetic method computationally...
Conserved Binding Sites
Conservation of Protein Domains
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...

