Skip to main content
SpringerLink
Log in

On the complexity of string folding

  • Session 16: Algorithms II
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1099))

Included in the following conference series:

Abstract

A fold of a finite string S over a given alphabet is an embedding of S in some fixed infinite grid, such as the square or cubic mesh. The score of a fold is the number of pairs of matching string symbols which are embedded at adjacent grid vertices. Folds of strings in two- and three-dimensional meshes are considered, and the corresponding problems of optimizing the score or achieving a given target score are shown to be NP-hard.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S.A. Cook. The complexity of theorem-proving procedures. Proc. 3rd ACM Symp. on Theory of Comp. (1971), 151–158.

    Google Scholar 

  2. A.S. Fraenkel. Complexity of protein folding. Bull. Math. Biology 55, (1993), 1199–1210.

    Google Scholar 

  3. M. Garey and D. Johnson. Computers and Intractability. (W.H. Freeman and Co. 1979).

    Google Scholar 

  4. W.E. Hart and S. Istrail. Fast protein folding in the hydrophobic-hydrophilic model within three-eighths of optimal. Proc. 27th ACM Symp. on Theory of Comp. (1995), 157–168.

    Google Scholar 

  5. D. Lichtenstein. Planar formulae and their uses. SIAM J. Computing 11, (1982), 329–343.

    Article  Google Scholar 

  6. J.T. Ngo and J. Marks. Computational complexity of a problem in molecular structure prediction. Protein Engineering 5, (1992), 313–321.

    PubMed  Google Scholar 

  7. R. Unger and J. Moult. Finding the lowest free energy conformation of a protein is an NP-hard problem: proof and implications. Bull. Math. Biology 55, (1993), 1183–1198.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Warwick, CV4 7AL, Coventry, UK

    Mike Paterson

  2. Department of Mathematics and Computer Science, Odense University, DK 5230, Odense M, Denmark

    Teresa Przytycka

Authors
  1. Mike Paterson
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Teresa Przytycka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Friedhelm Meyer Burkhard Monien

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Paterson, M., Przytycka, T. (1996). On the complexity of string folding. In: Meyer, F., Monien, B. (eds) Automata, Languages and Programming. ICALP 1996. Lecture Notes in Computer Science, vol 1099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61440-0_167

Download citation

  • DOI: https://doi.org/10.1007/3-540-61440-0_167

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61440-1

  • Online ISBN: 978-3-540-68580-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation