A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Steiner minimal trees, twist angles, and the protein folding problem
2006
Proteins: Structure, Function, and Bioinformatics
The Steiner Minimal Tree (SMT) problem determines the minimal length network for connecting a given set of vertices in threedimensional space. SMTs have been shown to be useful in the geometric modeling and characterization of proteins. Even though the SMT problem is an NP-Hard Optimization problem, one can define planes within the amino acids that have a surprising regularity property for the twist angles of the planes. This angular property is quantified for all amino acids through the
doi:10.1002/prot.21257
pmid:17173288
fatcat:pxg6wmarqjbphiumxmwnrxbn3i