A Multi-Dimensional Width-Bounded Geometric Separator and its Applications to Protein Folding
We used a divide-and-conquer algorithm to recursively solve the two-dimensional problem of protein folding of an HP sequence with the maximum number of H-H contacts. We derived both lower and upper bounds for the algorithmic complexity by using the newly introduced concept of multi-directional w...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
ScholarWorks@UNO
2005
|
| Subjects: | |
| Online Access: | http://scholarworks.uno.edu/td/238 http://scholarworks.uno.edu/cgi/viewcontent.cgi?article=1242&context=td |