The algorithmics of folding proteins on lattices.

DOI10.1016/S0166-218X(02)00381-5zbMath1038.92013OpenAlexW2056633203MaRDI QIDQ1868718

Vijay Chandru, Abhi Dattasharma, V. S. Anil Kumar

Publication date: 28 April 2003

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(02)00381-5

Mathematics Subject Classification ID

Biochemistry, molecular biology (92C40)

Related Items (3)

Protein folding in the HP model on grid lattices with diagonals ⋮ A weighted HP model for protein folding with diagonal contacts ⋮ Clique-detection models in computational biochemistry and genomics

Cites Work

• On the intractability of protein folding with a finite alphabet of amino acids
• Finding the lowest free energy conformation of a protein is an NP-hard problem: Proof and implications
• Complexity of protein folding
• 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
• The protein structure prediction problem: A constraint optimization approach using a new lower bound
• On the complexity of string folding
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The algorithmics of folding proteins on lattices.