Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Approximation algorithms for NP-hard problems
On the complexity of string folding
Discrete Applied Mathematics - Special volume on computational molecular biology
On the complexity of protein folding (abstract)
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
CPM '96 Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching
Gadgets Approximation, and Linear Programming
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On the Complexity of String Folding
On the Complexity of String Folding
On the complexity of protein folding (extended abstract)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
On the complexity of protein folding (abstract)
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
Approximation Algorithms for String Folding Problems
TCS '00 Proceedings of the International Conference IFIP on Theoretical Computer Science, Exploring New Frontiers of Theoretical Informatics
Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
The algorithmics of folding proteins on lattices
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
Approximate protein folding in the HP side chain model on extended cubic lattices
Discrete Applied Mathematics - Special issue: Computational molecular biology series issue IV
| Hi-index | 0.00 |