Geometric Separators and Their Applications to Protein Folding in the HP-Model
From MaRDI portal
Publication:3519385
Recommendations
- A \(2^{O(n^{1-{1\over d}}\log n)}\) time algorithm for \(d\)-dimensional protein folding in the HP-model
- MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
- Algorithms and Computation
- Protein folding in the HP model on grid lattices with diagonals
- Protein folding in the HP model on grid lattices with diagonals (extended abstract)
Cited in
(8)- Stieltjes integration and differential geometry: A model for enzyme recognition, discrimination, and catalysis
- Geometric models for secondary structures in proteins
- MULTI-DIRECTIONAL WIDTH-BOUNDED GEOMETRIC SEPARATOR AND PROTEIN FOLDING
- A \(2^{O(n^{1-{1\over d}}\log n)}\) time algorithm for \(d\)-dimensional protein folding in the HP-model
- Algorithms and Computation
- Balanced line separators of unit disk graphs
- Theory and application of width bounded geometric separators
- Sublinear time width-bounded separators and their application to the protein side-chain packing problem
This page was built for publication: Geometric Separators and Their Applications to Protein Folding in the HP-Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3519385)