Abstract
Application of a dynamic programming method allows one to find the best possible lattice model of a protein chain fold for any lattice and any orientation of the protein relative to the lattice. Special repulsive potentials help to obtain the self-avoiding lattice models of protein folds. The quality of approximation increases when the distance between neighbor chain links is not fixed rigidly. The calculations carried out for the proteins of different structural classes show a high efficiency and precision of this method in comparison with other ones.
| Translated title of the contribution | A rapid and precise method for lattice approximation of the course of a protein chain based on a dynamic programming algorithm |
|---|---|
| Original language | Russian |
| Pages (from-to) | 855-864 |
| Number of pages | 10 |
| Journal | Molekulyarnaya Biologiya |
| Volume | 28 |
| Issue number | 4 |
| State | Published - Jul 1994 |
Fingerprint
Dive into the research topics of 'A rapid and precise method for lattice approximation of the course of a protein chain based on a dynamic programming algorithm'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver