Download Finding an upper bound for the number of contacts in hydrophobic

Survey
yes no Was this document useful for you?
   Thank you for your participation!

* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project

Document related concepts

Structural alignment wikipedia , lookup

Protein wikipedia , lookup

Circular dichroism wikipedia , lookup

Implicit solvation wikipedia , lookup

Bimolecular fluorescence complementation wikipedia , lookup

Proteomics wikipedia , lookup

Protein mass spectrometry wikipedia , lookup

Protein design wikipedia , lookup

Intrinsically disordered proteins wikipedia , lookup

Protein domain wikipedia , lookup

Alpha helix wikipedia , lookup

Western blot wikipedia , lookup

Protein purification wikipedia , lookup

Rosetta@home wikipedia , lookup

Protein folding wikipedia , lookup

Cyclol wikipedia , lookup

Protein–protein interaction wikipedia , lookup

Homology modeling wikipedia , lookup

Nuclear magnetic resonance spectroscopy of proteins wikipedia , lookup

Protein structure prediction wikipedia , lookup

Transcript
Finding
an
upper
bound
for
the
number
of
contacts
in
hydrophobic-hydrophilic protein structure prediction model.
Numsu Ahn and Sungsoo Park
It is believed that the functional properties of the protein are dependent on its structure. Therefore, it is critical to
predict the protein's structure to understand the functional properties. One of the most widely studied protein
structure prediction models is the hydrophobic-hydrophilic (HP) model, which abstracts the dominant force in
protein folding. That is, to explain the hydrophobic interaction, the HP model tries to maximize the number of
contacts among hydrophobic amino acids. Although a number of heuristics have been proposed to find a tight
lower bound for the number of contacts, these methods cannot guarantee the quality of the obtained solution
since no information on upper bound has been obtained. In this research, we focus on identifying the efficiently
computable upper bound. We present a new mathematical formulation of the HP model, which can provide an
upper bound using linear relaxation of the formulation. Computational experiments using benchmark problems
show that our formulation provides tight upper bound.