The protein sequence design problem in canonical model on 2D and 3D lattices

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

Volumn 3109, Issue , 2004, Pages 244-253

  Berman, Piotr ^a   DasGupta, Bhaskar ^b   Mubayi, Dhruv ^c   Sloan, Robert ^a   Turán, György ^b   Zhang, Yi ^c  

^a The Pennsylvania State University   (United States)

^b 1120 Science and Engineering Offices   (United States)

^c UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AMINO ACIDS; CRYSTAL LATTICES; HYDROPHOBICITY; PATTERN MATCHING; POLYNOMIAL APPROXIMATION; PROTEINS; STRUCTURAL DESIGN;

AMINO ACID RESIDUES; CANONICAL MODELING; ENERGY FUNCTIONS; GEOMETRIC REPRESENTATION; GLOBAL ENERGY MINIMA; HYDROPHOBIC RESIDUES; INVERSE PROTEIN FOLDING; PROTEIN SEQUENCE DESIGN;

INVERSE PROBLEMS;

EID: 35048820980     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27801-6_18     Document Type: Article

References (27)

1. Y. Asahiro, K. Iwama,H. Tamaki and T. Tokuyama. Greedily Finding a Dense Subgraph, Journal of Algorithms 34,203-221,2000.
2. Y. Asahiro, R. Hassin and K. Iwama. Complexity of finding dense subgraphs, Discrete Applied Mathematics 121, 15-26,2002.
3. J. Atkins and W. E. Hart. On the intractability of protein folding with a finite alphabet of amino acids, Algorithmica, 25(2-3):279-294, 1999.
4. J. Banavar, M. Cieplak, A. Maritan, G. Nadig, F. Seno, and S. Vishveshwara. Structure-based design of model proteins, Proteins: Structure, Function, and Genetics, 31:10-20, 1998.
5. B. Berger and T. Leighton. Protein folding in the hydrophobic-hydrophilic (HP) model is NP-complete, Journal of Computational Biology, 5(1):27-40, 1998.
6. P. Herman, B. DasGupta and S. Muthukrishnan. Approximation Algorithms For MAX-MIN Tiling, Journal of Algorithms, 47 (2), 122-134, July 2003.
7. P. Crescenzi, D. Goldman, C. Papadimitriou, A. Piccolboni, and M. Yannakakis. On the complexity of protein folding, Journal of Computational Biology, 423-466, 1998.
8. J. M. Deutsch and T. Kurosky. New algorithm for protein design, Physical Review Letters, 76:323-326, 1996.
9. K. A. Dill, S. Bromberg, K. Yue, K. M. Fiebig, D. P. Yee, P. D. Thomas, and H. S. Chan. Principles of protein folding - A perspective from simple exact models, Protein Science, 4:561-602, 1995.
10. K. E. Drexler. Molecular engineering: An approach to the development of general capabilities for molecular manipulation, Proceedings of the National Academy of Sciences of the U.S.A., 78:5275-5278, 1981.
11. U. Feige and M. Seltser. On the densest k-subgraph problems. Technical Report # CS97-16, Faculty of Mathematics and Computer Science, Weizmann Institute of Science, Israel (available online at http://citeseer.nj.nec.com/ feige97densest.html).
12. W. E. Hart. On the computational complexity of sequence design problems, Proceedings of the 1st Annual International Conference on Computational Molecular Biology, 128-136, 1997.
13. W. E. Hart and S. Istrail. Fast protein folding in the hydrophobic-hydrophilic model within three-eighths of optimal, Journal of Computational Biology, 3(1):53-96, 1996.
14. W. E. Hart and S. Istrail. Invariant patterns in crystal lattices: Implications for protein folding algorithms (extended abstract), Lecture Notes in Computer Science 1075: Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, 288-303, 1996.
15. W. E. Hart and S. Istrail. Lattice and off-lattice side chain models of protein folding: Linear time structure prediction better than 86% of optimal, Journal of Computational Biology, 4(3):241-260, 1997.
16. V. Heun. Approximate protein folding in the HP side chain model on extended cubic lattices, Lecture Notes in Computer Science 1643: Proceedings of the 7th Annual European Symposium on Algorithms, 212-223, 1999.
17. D. Hochbaum. Approximation Algorithms for NP-hard problems, PWS Publishing Company, 1997.
18. D. S. Hochbaum and W. Mass. Approximation schemes for covering and packing problems in image processing and VLSI, Journal of ACM, 32(1):130-136, 1985.
19. J. Kleinberg. Efficient Algorithms for Protein Sequence Design and the Analysis of Certain Evolutionary Fitness Landscapes., Proceedings of the 3rd Annual International Conference on Computational Molecular Biology, 226-237, 1999.
20. K. F. Lau and K. A. Dill. A lattice statistical mechanics model of the conformational and sequence spaces of proteins, Macromolecules, 22:3986-3997, 1989.
21. G. Mauri, G. Pavesi, and A. Piccolboni. Approximation algorithms for protein folding prediction, Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, 945-946, 1999.
22. K. M. Merz and S. M. L. Grand, editors. The Protein Folding Problem and Tertiary Structure Prediction, Birkhauser, Boston, MA, 1994.
23. J. Ponder and F. M. Richards. Tertiary templates for proteins, Journal of Molecular Biology, 193:63-89, 1987.
24. S. J. Sun, R. Brem, H. S. Chan, and K. A. Dill. Designing amino acid sequences to fold with good hydrophobic cores, Protein Engineering, 8(12):1205-1213, Dec. 1995.
25. E. I. Shakhnovich and A. M. Gutin. Engineering of stable and fast-folding sequences of model proteins, Proc. Natl.Acad.Sci., 90:7195-7199, 1993.
26. T. F. Smith, L. L. Conte, J. Bienkowska, B. Rogers, C. Gaitatzes, and R. H. Lathrop. The threading approach to the inverse protein folding problem, Proceedings of the 1st Annual International Conference on Computational Molecular Biology, 287-292, 1997.
27. K. Yue and K. A. Dill. Inverse protein folding problem: Designing polymer sequences, Proceedings of the National Academy of Sciences of the U.S.A., 89:4163-4167, 1992.