Many important molecular conformation problems, such as protein folding, are expressed as global minimization problems. It is the fact that local minimization is insufficient, that markedly differentiates this volume from the previous two. Unfortunately, global minimization problems that result from models of molecular conformation are usually intractable. For example, simple 1-dimensional versions of distance conformation problems are NP-hard. Nevertheless, there has been significant recent progress in the design of promising heuristic strategies (often involving the use of high- performance parallel computers) for computing approximate global minimizers. The purpose of the sessions represented in this volume was to discuss the new algorithmic advances for global minimization in the context of protein folding and related molecular minimization problems. Emphasis was on practical shortcomings of current approaches, outstanding problems and questions, and the use of high-performance parallel computers.
Reihe
Sprache
Verlagsort
Verlagsgruppe
Illustrationen
Dateigröße
ISBN-13
978-1-4612-0693-4 (9781461206934)
DOI
10.1007/978-1-4612-0693-4
Schweitzer Klassifikation
CGU: An algorithm for molecular structure prediction.- Potential transformation method for global optimization.- Multispace search for protein folding.- Modeling the structure of ice as a problem in global minimization.- Novel Applications of Optimization to Molecule Design.- Issues in large-scale global molecular optimization.- Global minimization of Lennard-Jones functions on transputer networks.- Variable-scale coarse-graining in macromolecular global optimization.- Global optimization for molecular clusters using a new smoothing approach.
