On the complexity of string folding

DOI10.1016/S0166-218X(96)00065-0zbMath0879.92010OpenAlexW2013255051MaRDI QIDQ5961626

Teresa M. Przytycka, Mike S. Paterson

Publication date: 25 February 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

Mathematics Subject Classification ID

Applications of graph theory (05C90) Planar graphs; geometric and topological aspects of graph theory (05C10) Biochemistry, molecular biology (92C40) Complexity and performance of numerical algorithms (65Y20) Computational methods for problems pertaining to biology (92-08)

Related Items (2)

Stochastic protein folding simulation in the three-dimensional HP-model ⋮ The algorithmics of folding proteins on lattices.

Cites Work

• Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications
• Complexity of protein folding
• Planar Formulae and Their Uses
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the complexity of string folding