Abstract

In order to find the global minimum of the energy of a polypeptide, it is necessary to perform a global search, rather than a local one as is carried out by most standard minimization algorithms. A technique is described for locating the global minimum by means of a relatively efficient search over all possible conformations; after investigation, it eliminates whole regions of conformation space not likely to contain the lowestative minimum. An illustr test of it on “tetraglycine” is presented.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.