A constraint-based approach to fast and exact structure prediction in three-dimensional protein models
From MaRDI portal
Publication:850456
DOI10.1007/s10601-006-6848-8zbMath1103.68959OpenAlexW2048583196MaRDI QIDQ850456
Publication date: 3 November 2006
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-006-6848-8
Related Items (5)
Mathematical programming in computational biology: an annotated bibliography ⋮ Unraveling the beautiful complexity of simple lattice model polymers and proteins using Wang-Landau sampling ⋮ Constraint programming in structural bioinformatics ⋮ CLP-based protein fragment assembly ⋮ An efficient approach for solving the HP protein folding problem based on UEGO
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A polynomial time upper bound for the number of contacts in the HP-model on the face-centered-cubic lattice (FCC)
- Excluding symmetries in constraint-based search
- A Sufficient Condition for Backtrack-Free Search
- Self-avoiding walks on the simple cubic lattice
- The protein structure prediction problem: A constraint optimization approach using a new lower bound
This page was built for publication: A constraint-based approach to fast and exact structure prediction in three-dimensional protein models