Complexity of protein folding
type: Item
instance of: scholarly article
title: Complexity of protein folding
zbMATH Open document ID: 0791.92010
DOI: 10.1007/BF02460704
published in: Bulletin of Mathematical Biology
publication date: 1994-04-19T00:00:00Z
Mathematics Subject Classification ID: 92C40
Mathematics Subject Classification ID: 92-08
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 553791
zbMATH Keywords: amino acids
zbMATH Keywords: DNA chain
zbMATH Keywords: protein folding
zbMATH Keywords: native folded three-dimensional conformation of a protein
zbMATH Keywords: lowest free energy state
zbMATH Keywords: free energy minimization problem
zbMATH Keywords: NP-hard
Wikidata QID: Q52388445
author: Aviezri S. Fraenkel
MaRDI profile type: Publication
cites work: Q3324796
cites work: Experimental quantum cryptography.
cites work: Quantum cryptography without Bell’s theorem
cites work: Modern cryptology. A tutorial
cites work: Q4279563
cites work: Quantum theory, the Church–Turing principle and the universal quantum computer
cites work: Quantum computational networks
cites work: Q4198056
cites work: Graph minors. XX: Wagner's conjecture
cites work: Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications
cites work: Q3139759
cites work: Q3671875
full work available at URL: https://doi.org/10.1007/bf02460704
OpenAlex ID: W2085196396
description: scientific article; zbMATH DE number 553791