Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Bioinformatics and Constraints
Constraints
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Inverse Protein Folding in 2D HP Mode (Extended Abstract)
CSB '04 Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference
The inverse protein folding problem on 2D and 3D lattices
Discrete Applied Mathematics
Hi-index | 0.01 |