The algorithmics of folding proteins on lattices. (Q1868718)

From MaRDI portal

Revision as of 15:27, 5 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	The algorithmics of folding proteins on lattices.	scientific article

Statements

scholarly article

0 references

The algorithmics of folding proteins on lattices. (English)

0 references

0 references

Abhi Dattasharma

0 references

V. S. Anil Kumar

0 references

Discrete Applied Mathematics

0 references

publication date

28 April 2003

0 references

MaRDI profile type

MaRDI publication profile

0 references

0 references

On the intractability of protein folding with a finite alphabet of amino acids

0 references

The protein structure prediction problem: A constraint optimization approach using a new lower bound

0 references

Large-scale optimization with applications. Part 3: Molecular structure and optimization. Proceedings of a 3-week workshop, July 10--28, 1995, IMA, University of Minnesota, Minneapolis, MN, USA

0 references

0 references

0 references

Complexity of protein folding

0 references

0 references

0 references

0 references

0 references

0 references

On the complexity of string folding

0 references

0 references

Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0166-218X(02)00381-5

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1868718

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1868718&oldid=34338480"