[A rapid and precise method for lattice approximation of the course of a protein chain based on a dynamic programming algorithm].
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.
Rykunov
D S
DS
Reva
B A
BA
Finkel'shteĭn
A V
AV
D000465:Algorithms; D008958:Models, Molecular; D017510:Protein Folding; D011506:Proteins / Q000737:chemistry*
D011506:Proteins
Bystryĭ i tochnyĭ metod reshetochnoĭ approksimatsii khoda belkovoĭ tsepi, osnovannyĭ na algoritme dinamicheskogo programmirovaniia.