Answers are grounded in this paper and cite their sources.
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-avoiding lattice chains. The results of model building show the efficiency and precision of this proposed general method when compared with others.
No takes yet. Share an insight, caveat, or question.
Rykunov et al. (1995) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: