2006
DOI: 10.1093/bioinformatics/btl481
|View full text |Cite
|
Sign up to set email alerts
|

Hierarchical and multi-resolution representation of protein flexibility

Abstract: 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 a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
25
0
1

Year Published

2007
2007
2012
2012

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 33 publications
(26 citation statements)
references
References 40 publications
0
25
0
1
Order By: Relevance
“…Therefore, before conducting docking studies, we analyzed the optimal configuration of this cap and the hydrophobic pocket that it creates, through rotation of the cap using FlexTree 31. The cap was rotated in 1 degree increments +/−15° as a rigid structure, about the Pro242 and Thr263 pivot points (Fig.…”
Section: Computational Analyses Of the C-terminal Domain Pocketmentioning
confidence: 99%
“…Therefore, before conducting docking studies, we analyzed the optimal configuration of this cap and the hydrophobic pocket that it creates, through rotation of the cap using FlexTree 31. The cap was rotated in 1 degree increments +/−15° as a rigid structure, about the Pro242 and Thr263 pivot points (Fig.…”
Section: Computational Analyses Of the C-terminal Domain Pocketmentioning
confidence: 99%
“…Zhao et al [3] recently presented Flexibility Tree (FT). The FT is a hierarchical data structure which represents conformational subspaces of proteins and full flexibility of small ligands.…”
Section: Optimization Algorithms For Backbonementioning
confidence: 99%
“…An interesting data structure, called flexibility tree, can be employed in the search for the docked complex structure and it allows to combine several flexibility techniques [95]. The data structure hierarchically encodes the flexibility of a protein in variables that allow several protein parts to experience different kinds of moves.…”
Section: Approaches That Consecutively Place Ligands and Optimize Thementioning
confidence: 99%