Related Experiment Video
Updated: Aug 19, 2026

Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
Published on: December 7, 2021
An adaptive dynamic programming algorithm for the side chain placement problem
Andrew Leaver-Fay1, Brian Kuhlman, Jack Snoeyink
1UNC-Chapel Hill, Chapel Hill, NC 27514, USA. leaverfa@email.unc.edu
Abstract:
Larger rotamer libraries, which provide a fine grained discretization of side chain conformation space by sampling near the canonical rotamers, allow protein designers to find better conformations, but slow down the algorithms that search for them. We present a dynamic programming solution to the side chain placement problem which treats rotamers at high or low resolution only as necessary. Dynamic programming is an exact technique; we turn it into an approximation, but can still analyze the error that can be introduced. We have used our algorithm to redesign the surface residues of ubiquitin's beta sheet.
Related Concept Videos
Rolling Resistance: Problem Solving
Statically Indeterminate Problem Solving
Lagrange Multipliers: Problem Solving
Distributed Loads: Problem Solving
Bearings: Problem Solving
The Chain Rule: Problem Solving