Abstract
We propose a new algorithmic approach for global optimization in protein folding. We use the information found in various local minima to direct the search for the global minimum. In this way, we explore the energy landscape efficiently by considering only the space of local minima instead of the whole feasible space of conformations.
Original language | English (US) |
---|---|
Pages (from-to) | 642-643 |
Number of pages | 2 |
Journal | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Volume | 2723 |
DOIs | |
State | Published - 2003 |
Externally published | Yes |
ASJC Scopus subject areas
- General Computer Science
- General Biochemistry, Genetics and Molecular Biology
- Theoretical Computer Science