| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |
Biophys J, December 2000, p. 2818-2824, Vol. 79, No. 6

and
*Computer Science and Engineering Department, University of
California at San Diego, San Diego, California 92093 USA;
Department of Computer Science, University of
Wisconsin-Eau Claire, Eau Claire, Wisconsin 54702 USA;
Department of Mathematics, Chungnam National University,
Taejon 305-764, Korea; and §Department of Pharmaceutical
Chemistry, University of California at San Francisco, San
Francisco, California 94118 USA
Models in computational biology, such as those used in
binding, docking, and folding, are often empirical and have adjustable parameters. Because few of these models are yet fully predictive, the
problem may be nonoptimal choices of parameters. We describe an
algorithm called ENPOP (energy function parameter optimization) that
improves
and sometimes optimizes
the parameters for any given model
and for any given search strategy that identifies the stable state of
that model. ENPOP iteratively adjusts the parameters simultaneously to
move the model global minimum energy conformation for each of
m different molecules as close as possible to the true
native conformations, based on some appropriate measure of structural
error. A proof of principle is given for two very different test
problems. The first involves three different two-dimensional model
protein molecules having 12 to 37 monomers and four parameters in
common. The parameters converge to the values used to design the model
native structures. The second problem involves nine bumpy landscapes,
each having between 4 and 12 degrees of freedom. For the three
adjustable parameters, the globally optimal values are known in
advance. ENPOP converges quickly to the correct parameter set.
Biophys J, December 2000, p. 2818-2824, Vol. 79, No. 6
© 2000 by the Biophysical Society 0006-3495/00/12/2818/07 $2.00
| HOME | HELP | FEEDBACK | SUBSCRIPTIONS | ARCHIVE | SEARCH | TABLE OF CONTENTS |