Abstract
It is shown how one can apply more efficient continuous minimization techniques to the energy minimization problem by using an accurate continuous approximation to the discrete information provided for known protein structures. The results of one particular computational method for protein structure prediction (the CGU algorithm) is shown, which is based on the continuous minimization technique. The method can be used both to accurately determine the global minimum of potential energy function and also to offer a quantitative analysis of all of the local minima on the energy landscape.
| Original language | English |
|---|---|
| Pages | 109-117 |
| Number of pages | 9 |
| DOIs | |
| State | Published - 1997 |
| Event | Proceedings of the 1997 1st Annual International Conference on Computational Molecular Biology, RECOMB - Santa Fe, NM, USA Duration: Jan 20 1997 → Jan 23 1997 |
Conference
| Conference | Proceedings of the 1997 1st Annual International Conference on Computational Molecular Biology, RECOMB |
|---|---|
| City | Santa Fe, NM, USA |
| Period | 01/20/97 → 01/23/97 |
Fingerprint
Dive into the research topics of 'Protein structure prediction and potential energy landscape analysis using continuous global minimization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver