The inverse protein folding problem on 2D and 3D lattices

DOI10.1016/j.dam.2005.09.018zbMath1113.92024OpenAlexW1974882476MaRDI QIDQ876470

Robert H. Sloan, György Turán, Piotr Berman, Dhruv Mubayi, Yi Zhang, Bhaskar Das Gupta

Publication date: 18 April 2007

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

Full work available at URL: https://doi.org/10.1016/j.dam.2005.09.018

zbMATH Keywords

latticeapproximation schemesdensest subgraphcanonical modelinverse protein folding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Biochemistry, molecular biology (92C40) Lattices (06B99)

Cites Work

• On the intractability of protein folding with a finite alphabet of amino acids
• Complexity of finding dense subgraphs
• Approximation schemes for covering and packing problems in image processing and VLSI
• Approximation algorithms for MAX–MIN tiling
• Greedily Finding a Dense Subgraph
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The inverse protein folding problem on 2D and 3D lattices