Answers are grounded in this paper and cite their sources.
Algorithms underlying the automatic model-building functionality of the ARP/wARP software suite are presented. Finding the most likely set of Calpha atoms from a given set of atoms is formulated as a constrained integer programming problem. The objective function is a density-weighted score for the match between observed and expected chain conformation. Graph-search algorithms are presented that find solutions to this problem in an efficient manner.
No takes yet. Share an insight, caveat, or question.
Morris et al. (2002) studied this question.
Synapse has enriched 5 related papers. Consider them for comparative context: