On the approximation of protein threading

Theoretical Computer Science

Volumn 210, Issue 2, 1999, Pages 261-275

  Akutsu, Tatsuya ^a   Miyano, Satoru ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Approximation algorithms; Computational biology; Protein folding; Protein threading

Indexed keywords

EID: 0346967395     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00089-9     Document Type: Article

References (18)

1. R. Agarwala, S. Batzoglou, V. Dancčík, S.E. Decatur, M. Farach, S. Hannenhalli, S. Skiena, Local rules for protein folding on a triangular lattice and generalized hydrophobicity in the HP model, in: Proc. 8th ACM-SIAM Symp. Discrete Algorithms, 1997, pp. 390-399.
2. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation algorithms, in: Proc. 33rd IEEE Symp. Foundations of Computer Science, 1992, pp. 14-23.
3. J.U. Bowie, R. Lüthy, D. Eisenberg, A method to identify protein sequences that fold into a known three-dimensional structures, Science 253 (1991) 164-170.
4. C. Branden, J. Tooze, Introduction to Protein Structure, Garland Publishing, New York, 1991.
5. S.H. Bryant, C.E. Lawrence, An empirical energy function for threading protein sequence through the folding motif, PROTEINS: Structure, Function, and Genetics 16 (1993) 92-112.
6. C. Chothia, One thousand families for the molecular biologist, Nature 357 (1992) 543-544.
7. F.R.K. Chung, F.T. Leighton, A.L. Rosenberg, Embedding graphs in books: a layout problem with applications to VLSI design, SIAM J. Discrete Math. 8 (1987) 33-58.
8. A. Godzik, J. Skolnick, Sequence-structure matching in globular proteins: application to supersecondary and tertiary structure determination, Proc. National Academy of Science USA 89 (1992) 12098-12102.
9. W.E. Hart, S.C. Istrail, Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal, J. Comput. Biol. 3 (1996) 53-96.
10. D.T. Jones, W.R. Taylor, J.M. Thornton, A new approach to protein fold recognition, Nature 358 (1992) 86-89.
11. G. Kortsarz, D. Peleg, On choosing a dense subgraph, in: Proc. 34th IEEE Symp. Foundations of Computer Science, 1993, pp. 692-701.
12. R.H. Lathrop, The protein threading problem with sequence amino acid interaction preferences is NP-complete, Protein Eng. 7 (1994) 1059-1068.
13. R.H. Lathrop, T.F. Smith, Global optimum protein threading with gapped alignment and empirical pair score functions, J. Mol. Biol. 255 (1996) 641-665.
14. L. Lovász, Combinatorial Problems and Exercises, Akadémiai Kiadó, Budapest, 1979.
15. D. Maier, The complexity of some problems on subsequences and supersequences, J. ACM 25 (1978) 322-336.
16. T. Nishizeki, N. Chiba, Planar Graphs: Theory and Algorithms, Elsevier, Amsterdam, 1988.
17. C.H. Papadimitriou, M. Yannakakis, Optimization, approximation, and complexity classes, J. Comput. System Sci. 43 (1991) 425-440.
18. Y. Xu, E.C. Uberbacher, A polynomial-time algorithm for a class of protein threading problems, Comput. Appl. Biosci. 12 (1996) 511-517.