Complexity of protein folding

DOI10.1007/BF02460704zbMath0791.92010OpenAlexW2085196396WikidataQ52388445 ScholiaQ52388445MaRDI QIDQ1319880

Aviezri S. Fraenkel

Publication date: 19 April 1994

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02460704

zbMATH Keywords

amino acidsNP-hardprotein foldingDNA chainfree energy minimization problemlowest free energy statenative folded three-dimensional conformation of a protein

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Biochemistry, molecular biology (92C40) Computational methods for problems pertaining to biology (92-08)

Related Items

Accelerating a continuous-time analog SAT solver using GPUs, Physical portrayal of computational complexity, An integer programming model for protein structure prediction using the 3D-HP side chain model, An incompressibility theorem for automatic complexity, Self-assembly of 3-D structures using 2-D folding tiles, On the complexity of string folding, Revisiting chameleon sequences in the protein data bank, Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications, The algorithmics of folding proteins on lattices., Approximate protein folding in the HP side chain model on extended cubic lattices

Cites Work

• Graph minors. XX: Wagner's conjecture
• Modern cryptology. A tutorial
• Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications
• Experimental quantum cryptography.
• Quantum computational networks
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Quantum cryptography without Bell’s theorem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item