Exact enumeration of three-dimensional lattice proteins
From MaRDI portal
Publication:709694
Abstract: We present an algorithm for the exhaustive enumeration of all monomer sequences and conformations of short lattice proteins as described by the hydrophobic-polar (HP) model. The algorithm is used for an exact identification of all designing sequences of HP proteins consisting of up to 19 monomers whose conformations are represented by interacting self-avoiding walks on the simple cubic lattice. Employing a parallelized implementation on a Linux cluster, we generate the complete set of contact maps of such walks.
Recommendations
- Combinatorial algorithms for protein folding in lattice models: a survey of mathematical results
- scientific article; zbMATH DE number 2196284
- The inverse protein folding problem on 2D and 3D lattices
- On a 3D-matrix representation of the tertiary structure of a protein
- Approximation algorithms for three dimensional protein folding
- Approximation algorithms for three dimensional protein folding
- A deterministic algorithm for constrained enumeration of transmembrane protein folds
- Combinatorial Pattern Matching
- A New Constraint Solver for 3D Lattices and Its Application to the Protein Folding Problem
Cites work
Cited in
(6)- A deterministic algorithm for constrained enumeration of transmembrane protein folds
- scientific article; zbMATH DE number 2130523 (Why is no real title available?)
- Efficient algorithm for computing exact partition functions of lattice polymer models
- Exact enumeration of Hamiltonian walks on the \(4\times 4\times 4\) cube and applications to protein folding
- Three-dimensional off-lattice AB model protein with the 89-residue Fibonacci sequence
- Parallel algorithm for calculation of the exact partition function of a lattice polymer
This page was built for publication: Exact enumeration of three-dimensional lattice proteins
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709694)