Combinatorial problems on strings with applications to protein folding

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2976, Issue , 2004, Pages 369-378

  Newman, Alantha ^a   Ruhl, Matthias ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINS; PROTEIN FOLDING; PROTEINS;

APPROXIMATION RATIOS; BINARY STRING; COMBINATORIAL PROBLEM; LINEAR TIME; LOWER BOUNDS; NON-TRIVIAL; SELF AVOIDING WALK; SQUARE LATTICES;

APPROXIMATION ALGORITHMS;

EID: 35048836599     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24698-5_41     Document Type: Article

References (6)

1. [BL98] Bonnie Berger and Tom Leighton. Protein Folding in the Hydrophobic-Hydrophilic (HP) Model is NP-Complete. In Proceedings of the 2nd Conference on Computational Molecular Biology (RECOMB), 1998.
2. +98] P. Crescenzi, D. Goldman, C. Papadimitriou, A. Piccolboni, and M. Yannakakis. On the Complexity of Protein Folding. In Proceedings of the 2nd Conference on Computational Molecular Biology (RECOMB), 1998.
3. [Dil85] K. A. Dill. Theory for the Folding and Stability of Globular Proteins. Biochemistry, 24:1501, 1985.
4. [Dil90] K. A. Dill. Dominant Forces in Protein Folding. Biochemistry, 29:7133-7155, 1990.
5. [HI95] William E. Hart and Sorin Istrail. Fast Protein Folding in the Hydrophobic-hydrophilic Model within Three-eighths of Optimal. In Proceedings of the 27th ACM Symposium on the Theory of Computing (STOC), 1995.
6. [New02] Alantha Newman. A New Algorithm for Protein Folding in the HP Model. In Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2002.