Publication Date


Advisor(s) - Committee Chair

Dr. Di Wu (Director), Dr. Claus Ernst, Dr. Claire A. Rinehart

Degree Program

Department of Mathematics and Computer Science

Degree Type

Master of Science in Applied Mathematics


Proteins carry out an almost innumerable amount of biological processes that are absolutely necessary to life and as a result proteins and their structures are very often the objects of study in research. As such, this thesis will begin with a description of protein function and structure, followed by brief discussions of the two major experimental structure determination methods. Another problem that often arises in molecular modeling is referred to as the Molecular Distance Geometry Problem (MDGP). This problem seeks to find coordinates for the atoms of a protein or molecule when given only a set of pair-wise distances between atoms. To introduce the complexities of the MDGP we begin at its origins in distance geometry and progress to the specific sub-problems and some of the solutions that have been developed. This is all in preparation for a discussion of what is known as the Geometric Build-up (GBU) Solution. This solution has lead to the development of several algorithms and continues to be modified to account for more and different complexities. The culmination of this thesis, then, is a new algorithm, the Revised Updated Geometric Build-up, that is faster than previous GBU’s while maintaining the accuracy of the resulting structure.


Applied Mathematics | Biochemistry | Molecular Biology | Structural Biology