| Article ID: | iaor19962079 |
| Country: | United States |
| Volume: | 22 |
| Issue: | 2 |
| Start Page Number: | 100 |
| End Page Number: | 109 |
| Publication Date: | Apr 1995 |
| Journal: | Proteins-Structure Function and Genetics |
| Authors: | Rykunov D.S., Reva B.A., Finkelstein V.A. |
| Keywords: | programming: dynamic |
An algorithm based on dynamic programming gives the lattice models having the minimal RMS deviations from the actual folds of protein (RNA, etc.) chains for a given lattice and a given orientation of the macromolecule relative to the lattice. The algorithm is applicable for 3-D lattices of any kind. The accuracy of the lattice approximation increases when the distance between neighbor chain links is not rigidly fixed. Special repulsive potentials facilitate generation of self-avoding lattice chains. The results of model building show the efficiency and precision of this proposed general method when compared with others.