A Branch-and-Bound Constraint Optimization Approach to the HPNX Structure Prediction Problem

@inproceedings{WillInstitut1998ABC,
  title={A Branch-and-Bound Constraint Optimization Approach to the HPNX Structure Prediction Problem},
  author={Sebastian WillInstitut},
  year={1998}
}
  • Sebastian WillInstitut
  • Published 1998
The protein structure prediction problem is one of the most important problems in computational biology. Because of the complexity of this problem, sim-pliied models like Dill's HP-lattice model 9, 10] have become a major tool for investigating general properties of protein folding. Even for this simpliied model, the structure prediction problem has been proven to be NP-complete 4, 2]. A disadvantage of the HP-problem is its high degeneracy. I.e., for every sequence there are a lot of… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-3 of 3 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 14 references

Kinetics of protein folding

View 10 Excerpts
Highly Influenced

Sequence-structure relationships in proteins and copolymers.

Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics • 1993
View 12 Excerpts
Highly Influenced

On the complexity of protein folding

P. Crescenzi, D. Goldman, C. Papadim- itriou, A. Piccolboni, M. Yan- nakakis
In Proc. of STOC, • 1998
View 11 Excerpts
Highly Influenced

Protein Folding in the Hydrophobic-Hydrophilic(HP) Model is NP-Complete

Journal of Computational Biology • 1998
View 11 Excerpts
Highly Influenced

From structure to sequence and back again.

Journal of molecular biology • 1996
View 1 Excerpt

The folding mechanism of larger model proteins: role of native structure.

Proceedings of the National Academy of Sciences of the United States of America • 1996
View 1 Excerpt

Similar Papers

Loading similar papers…