Skip Navigation


Bioinformatics Advance Access originally published online on September 18, 2006
Bioinformatics 2006 22(22):2768-2774; doi:10.1093/bioinformatics/btl481
This Article
Right arrow Full Text Freely available
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow All Versions of this Article:
22/22/2768    most recent
btl481v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (1)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Zhao, Y.
Right arrow Articles by Sanner, M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Zhao, Y.
Right arrow Articles by Sanner, M.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2006. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

Hierarchical and multi-resolution representation of protein flexibility

Yong Zhao 1, Daniel Stoffler 2 and Michel Sanner 1,*

1 Department of Molecular Biology, TPC26, The Scripps Research Institute La Jolla, CA, USA
2 F. Hoffmann-La Roche Ltd, Pharmaceuticals Division CH-4070 Basel, Switzerland

*To whom correspondence should be addressed.

Motivation: Conformational rearrangements during molecular interactions are observed in a wide range of biological systems. However, computational methods that aim at simulating and predicting molecular interactions are still largely ignoring the flexible nature of biological macromolecules as the number of degrees of freedom is computationally intractable when using brute force representations.

Results: In this article, we present a computational data structure called the Flexibility Tree (FT) that enables a multi-resolution and hierarchical encoding of molecular flexibility. This tree-like data structure allows the encoding of relatively small, yet complex sub-spaces of a protein's conformational space. These conformational sub-spaces are parameterized by a small number of variables and can be searched efficiently using standard global search techniques. The FT structure makes it straightforward to combine and nest a wide variety of motion types such as hinge, shear, twist, screw, rotameric side chains, normal modes and essential dynamics. Moreover, the ability to assign shapes to the nodes in a FT allows the interactive manipulation of flexible protein shapes and the interactive visualization of the impact of conformational changes on the protein's overall shape. We describe the design of the FT and illustrate the construction of such trees to hierarchically combine motion information obtained from a variety of sources ranging from experiment to user intuition, and describing conformational changes at different biological scales. We show that the combination of various types of motion helps refine the encoded conformational sub-spaces to include experimentally determined structures, and we demonstrate searching these sub-spaces for specific conformations.

Contact: sanner{at}scripps.edu

Supplementary information: Supplementary Data are available at Bioinformatics online.


Received on July 23, 2006; revised on September 8, 2006; accepted on September 11, 2006

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.