Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The Complexity of Some Problems on Subsequences and Supersequences
Journal of the ACM (JACM)
Protein folding in the hydrophobic-hydrophilic (HP) is NP-complete
RECOMB '98 Proceedings of the second annual international conference on Computational molecular biology
An anytime algorithm for gapped block protein threading with pair interactions
RECOMB '99 Proceedings of the third annual international conference on Computational molecular biology
Bioinformatics and Constraints
Constraints
Algorithmic Aspects of Protein Structure Similarity
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Hi-index | 0.00 |