Dramatic performance enhancements for the FASTER optimization algorithm

✍ Scribed by Benjamin D. Allen; Stephen L. Mayo

• Publisher: John Wiley and Sons
• Year: 2006
• Tongue: English
• Weight: 72 KB
• Volume: 27
• Category: Article
• ISSN: 0192-8651
• DOI: 10.1002/jcc.20420

✦ Synopsis

Abstract

FASTER is a combinatorial optimization algorithm useful for finding low‐energy side‐chain configurations in side‐chain placement and protein design calculations. We present two simple enhancements to FASTER that together improve the computational efficiency of these calculations by as much as two orders of magnitude with no loss of accuracy. Our results highlight the importance of choosing appropriate initial configurations, and show that efficiency can be improved by stringently limiting the number of positions that are allowed to relax in response to a perturbation. The changes we describe improve the quality of solutions found for large‐scale designs, and allow them to be found in hours rather than days. The improved FASTER algorithm finds low‐energy solutions more efficiently than common optimization schemes based on the dead‐end elimination theorem and Monte Carlo. These advances have prompted investigations into new methods for force field parameterization and multiple state design. © 2006 Wiley Periodicals, Inc. J Comput Chem 27: 1071–1075, 2006