Skip to main content
. 2012 Apr 19;8(4):e1002477. doi: 10.1371/journal.pcbi.1002477

Figure 2. Overview of Inline graphic Algorithm.

Figure 2

he Inline graphic algorithm searches over protein sequences and conformations to find the protein complexes with the best binding constant. Inline graphic takes an input model composed of an initial protein structure, a rotamer library to search over side-chain conformations, and an energy function to evaluate conformations. Minimization-aware DEE (minDEE) prunes rotamers that are not part of the lowest energy conformations for a given sequence. The remaining conformations from minDEE are enumerated in order of increasing energy lower bounds using A*. Finally, the conformations are Boltzmann-weighted and used to compute partition functions and ultimately a Inline graphic score for each sequence.