Abstract
A chain tree is a data structure for changing protein conformations. It enables very fast detection of clashes and free energy potential calculations. A modified version of chain trees that adjust themselves to the changing conformations of folding proteins is introduced. This results in much tighter bounding volume hierarchies and therefore fewer intersection checks. Computational results indicate that the efficiency of the adjustable chain trees is significantly improved compared to the traditional chain trees.
| Original language | English |
|---|---|
| Journal | Journal of Computational Biology |
| Volume | 19 |
| Issue number | 1 |
| Pages (from-to) | 83-99 |
| Number of pages | 17 |
| ISSN | 1066-5277 |
| DOIs | |
| Publication status | Published - 1 Jan 2012 |