HOME    »    PROGRAMS/ACTIVITIES    »    Annual Thematic Program
Talk Abstract
Approximate algorithms for the distance geometry problem

Panos M. Pardalos, University of Florida

The distance geometry problem is to determine the coordinates of a set of points in space given a set of pairwise distance measurements. Distance geometry is a common method for formulating space conformational problems in terms of distance measurements and recently has been used in determining the structure of proteins from NMR (Nuclear Magnetic Resonance) data. In this talk we present recent results and a tabu search based approach for the distance geometry problem.

Back to Workshop Schedule

1996-1997 Mathematics in High Performance Computing

Go