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

DOI10.1016/J.DAM.2005.09.018zbMATH Open1113.92024OpenAlexW1974882476MaRDI QIDQ876470FDOQ876470

R. H. Sloan, Bhaskar Dasgupta, Gy. Turán, Piotr Berman, Dhruv Mubayi, Yi Zhang

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

latticedensest subgraphapproximation schemescanonical modelinverse protein folding

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Greedily Finding a Dense Subgraph
• Complexity of finding dense subgraphs
• Approximation schemes for covering and packing problems in image processing and VLSI
• Approximation algorithms for MAX–MIN tiling
• Title not available (Why is that?)
• On the intractability of protein folding with a finite alphabet of amino acids
• Title not available (Why is that?)

Cited In (4)

• Exact enumeration of three-dimensional lattice proteins
• On the intractability of protein folding with a finite alphabet of amino acids
• Combinatorial Pattern Matching
• Protein Folding in 2D-Triangular Lattice Revisited

   Recommendations

• Combinatorial Pattern Matching 👍 👎
• Protein folding in the HP model on grid lattices with diagonals 👍 👎
• Mathematical Foundations of Computer Science 2004 👍 👎
• Title not available (Why is that?) 👍 👎
• Protein Folding in 2D-Triangular Lattice Revisited 👍 👎

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876470)