2001
DOI: 10.1002/prot.1081
|View full text |Cite
|
Sign up to set email alerts
|

Protein flexibility predictions using graph theory

Abstract: Techniques from graph theory are applied to analyze the bond networks in proteins and identify the flexible and rigid regions. The bond network consists of distance constraints defined by the covalent and hydrogen bonds and salt bridges in the protein, identified by geometric and energetic criteria. We use an algorithm that counts the degrees of freedom within this constraint network and that identifies all the rigid and flexible substructures in the protein, including overconstrained regions (with more crossl… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

13
891
0
3

Year Published

2008
2008
2017
2017

Publication Types

Select...
4
4

Relationship

2
6

Authors

Journals

citations
Cited by 705 publications
(912 citation statements)
references
References 50 publications
13
891
0
3
Order By: Relevance
“…For this, potential hydrogen bonds are ranked according to an energy function that takes into account the hybridization state of donor and acceptor atoms as well as their mutual orientation. 57 By tuning the energy threshold E HB , strong hydrogen bonds can be distinguished from weaker ones. Hydrogen bonds are included if their energy is e-1.0 kcal/mol.…”
Section: Methodsmentioning
confidence: 99%
“…For this, potential hydrogen bonds are ranked according to an energy function that takes into account the hybridization state of donor and acceptor atoms as well as their mutual orientation. 57 By tuning the energy threshold E HB , strong hydrogen bonds can be distinguished from weaker ones. Hydrogen bonds are included if their energy is e-1.0 kcal/mol.…”
Section: Methodsmentioning
confidence: 99%
“…Decompositions of the 33 protein structures (taken from PDB) into rigid clusters were performed using the FIRST software (28), which is an implementation of a network rigidity analysis algorithm for investigating protein rigidity and flexibility (29). Within each protein structure, decompositions were calculated for 100 values of the hydrogen bond cut-off energy, ranging from −0.05 kcal/mol to −5.00 kcal/mol thus producing 3300 rigid cluster decompositions.…”
Section: Methodsmentioning
confidence: 99%
“…We identify all sets of atoms that form rigid clusters by employing FIRST (Floppy Inclusion and Rigid Substructure Topography) software (28). The FIRST package is based on a "pebble game" algorithm (29). In less than a second of the computational time, it identifies all flexible and rigid regions in a protein structure and provides the essential information on local rigidity properties, such as whether a given atom belongs to a particular rigid cluster, overconstrained region, or region participating in a correlated motion.…”
Section: Introductionmentioning
confidence: 99%
“…StoneHingeP is unique in using constraint counting from rigidity theory, as implemented in ProFlex, as the basis for predictions. ProFlex (successor to the FIRST method 27 ) analyzes flexibility using a threedimensional constraint counting algorithm that decomposes a protein structure into rotatable and nonrotatable bonds. This analysis is based on bond rotational constraints placed by covalent and noncovalent bonds in the network.…”
Section: Identifying Hingesmentioning
confidence: 99%
“…The hydrogen bonds to internal waters can be important for the protein structure, whereas including surface waters tends to lead to overestimation of the rigidity of the protein. 27 All predictions presented here are made with internal water molecules only, as determined by PRO_ACT. 47 Predictions were also run using no water molecules (data not shown), as is done on the automated StoneHinge server.…”
Section: Protein Preparationmentioning
confidence: 99%