Solving hard problems by protein folding?

DOI10.1007/978-3-030-63000-3_3MaRDI QIDQ2038347zbMATH OpenOpenAlexFDO

Authors Andrzej Lingas

Publication date 6 July 2021

Full work available at URL https://doi.org/10.1007/978-3-030-63000-3_3

zbMATH Keywords

hard problemsprotein folding

Mathematics Subject Classification ID

Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• On the complexity of string folding
• scientific article; zbMATH DE number 1305531
• Complexity of protein folding
• Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications
• scientific article; zbMATH DE number 1342099

Cited in

(4)

• Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications
• Gauge fields, strings, solitons, anomalies, and the speed of life
• Folding proteins: how to set up an effcient metrics for dealing with complex systems
• On the complexity of string folding

This page was built for publication: Solving hard problems by protein folding?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2038347)