Loading...
Please wait, while we are loading the content...
Similar Documents
A Branch and Bound Algorithm for the Protein Folding Problem in the HP Lattice Model
| Content Provider | Semantic Scholar |
|---|---|
| Author | Chen, Mao Huang, Wen-Qi |
| Copyright Year | 2005 |
| Abstract | 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 algorithm is compared with other well-known methods for 10 benchmark sequences with lengths ranging from 20 to 100 monomers. The results indicate that our method is a very efficient and promising tool for the protein folding problem. |
| Starting Page | 225 |
| Ending Page | 230 |
| Page Count | 6 |
| File Format | PDF HTM / HTML |
| DOI | 10.1016/S1672-0229(05)03031-7 |
| Alternate Webpage(s) | http://www.brown.edu/Research/Istrail_Lab/papers/2005/bran-06.pdf |
| Alternate Webpage(s) | https://ftp.ncbi.nlm.nih.gov/pub/pmc/oa_pdf/cf/63/main.PMC5172541.pdf |
| Alternate Webpage(s) | http://cs.brown.edu/~sorin/lab/_proFolding/papers/2005/bran-06.pdf |
| PubMed reference number | 16689690 |
| Alternate Webpage(s) | https://doi.org/10.1016/S1672-0229%2805%2903031-7 |
| Journal | Medline |
| Volume Number | 3 |
| Journal | Genomics, proteomics & bioinformatics |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |