Branch-and-terminate: a combinatorial optimization algorithm for protein design.
BACKGROUND
Several deterministic and stochastic combinatorial optimization algorithms have been applied to computational protein design and homology modeling. As structural targets increase in size, however, it has become necessary to find more powerful methods to address the increased combinatorial complexity.


RESULTS
We present a new deterministic combinatorial search algorithm called 'Branch-and-Terminate' (B&T), which is derived from the Branch-and-Bound search method. The B&T approach is based on the construction of an efficient but very restrictive bounding expression, which is used for the search of a combinatorial tree representing the protein system. The bounding expression is used both to determine the optimal organization of the tree and to perform a highly effective pruning procedure named 'termination'. For some calculations, the B&T method rivals the current deterministic standard, dead-end elimination (DEE), sometimes finding the solution up to 21 times faster. A more significant feature of the B&T algorithm is that it can provide an efficient way to complete the optimization of problems that have been partially reduced by a DEE algorithm.


CONCLUSIONS
The B&T algorithm is an effective optimization algorithm when used alone. Moreover, it can increase the problem size limit of amino acid sidechain placement calculations, such as protein design, by completing DEE optimizations that reach a point at which the DEE criteria become inefficient. Together the two algorithms make it possible to find solutions to problems that are intractable by either algorithm alone.
Gordon
D B
DB
Division of Chemistry and Chemical Engineering California Institute of Technology Pasadena, California, 91125, USA.
Mayo
S L
SL
D000465:Algorithms; D008958:Models, Molecular; D015394:Molecular Structure; D015202:Protein Engineering / Q000379:methods*; D011506:Proteins / Q000138:chemical synthesis* / Q000737:chemistry
D011506:Proteins