On the complexity of protein folding (1998) [69 citations — 2 self]
Download:
|
|
by Pierluigi Crescenzi, Deborah Goldman, Christos Papadimitriou, Antonio Piccolboni, Mihalis Yannakakis
Journal of Computational Biology
http://www.cs.berkeley.edu/~christos/hp.ps
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@ARTICLE{Crescenzi98onthe,author = {Pierluigi Crescenzi and Deborah Goldman and Christos Papadimitriou and Antonio Piccolboni and Mihalis Yannakakis},
title = {On the complexity of protein folding},
journal = {Journal of Computational Biology},
year = {1998},
volume = {5},
pages = {597--603}
}
Years of Citing Articles
Abstract:
We show that the protein folding problem in the two-dimensional H-P model is NP-complete. 1
Citations
No citations identified.
