Cargando…
A Branch and Bound Algorithm for the Protein Folding Problem in the HP Lattice Model
A branch and bound algorithm is proposed for the two-dimensional protein folding problem in the HP lattice model. In this algorithm, the benefit of each possible location of hydrophobic monomers is evaluated and only promising nodes are kept for further branching at each level. The proposed algorith...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Elsevier
2005
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC5172541/ https://www.ncbi.nlm.nih.gov/pubmed/16689690 http://dx.doi.org/10.1016/S1672-0229(05)03031-7 |