Protein folding: computational approaches to an exponential-time problem
Annual review of computer science: vol. 3, 1988
Random networks in configuration space for fast path planning
Random networks in configuration space for fast path planning
On finding narrow passages with probabilistic roadmap planners
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
OBPRM: an obstacle-based PRM for 3D workspaces
WAFR '98 Proceedings of the third workshop on the algorithmic foundations of robotics on Robotics : the algorithmic perspective: the algorithmic perspective
Locked and unlocked polygonal chains in 3D
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Protein Structure Prediction: A Practical Approach
Protein Structure Prediction: A Practical Approach
Molecular Dynamics Simulation: Elementary Methods
Molecular Dynamics Simulation: Elementary Methods
Robot Motion Planning
A Motion Planning Approach to Flexible Ligand Binding
Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology
Folding and Unfolding in Computational Geometry
JCDCG '98 Revised Papers from the Japanese Conference on Discrete and Computational Geometry
A Motion Planning Approach to Folding: From Paper Craft to Protein Folding
A Motion Planning Approach to Folding: From Paper Craft to Protein Folding
A probabilistic method for rigid-body motion planning using sampling from the medial axis of the free space
Proceedings of the sixth annual international conference on Computational biology
Proceedings of the sixth annual international conference on Computational biology
Approximation of protein structure for fast similarity measures
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
Long proteins with unique optimal foldings in the H-P model
Computational Geometry: Theory and Applications - Special issue: The European workshop on computational geometry -- CG01
Using motion planning to study RNA folding kinetics
RECOMB '04 Proceedings of the eighth annual international conference on Resaerch in computational molecular biology
Feasibility of Motion Planning on Directed Graphs
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Feasibility of motion planning on acyclic and strongly connected directed graphs
Discrete Applied Mathematics
Algorithmic motion planning: the randomized approach
General Theory of Information Transfer and Combinatorics
Simulating protein motions with rigidity analysis
RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology
A multi-directional rapidly exploring random graph (mRRG) for protein folding
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Hi-index | 0.00 |
We present a framework for studying protein folding pathways and potential landscapes which is based on techniques recently developed in the robotics motion planning community. In particular, our work uses Probabilistic Roadmap (PRM) motion planning techniques which have proven to be very successful for problems involving high-dimensional configuration spaces. Our results applying PRM techniques to several small proteins (60 residues) are very encouraging. The framework enables one to easily and efficiently compute folding pathways from any denatured starting state to the native fold. This aspect makes our approach ideal for studying global properties of the protein's potential landscape. For example, our results show that folding pathways from different starting denatured states sometimes share some common `gullies', mainly when they are close to the native fold. Such global issues are difficult to simulate and study with other methods.Our focus in this work is to study the protein folding mechanism assuming we know the native fold. Therefore, instead of performing fold prediction, we aim to study issues related to the folding process, such as the formation of secondary and tertiary structure, and the dependence on the initial conformation. Our results indicate that for some proteins, secondary structure clearly forms first while for others the tertiary structure is obtained more directly, and moreover, these situations seem to be differentiated in the distributions of the conformations sampled by our technique. We also find that the formation order is independent of the starting denatured conformation. We validate our results by comparing the secondary structure formation order on our paths to known pulse-labeling experimental results. This indicates the promise of our approach for studying proteins for which experimental results are not available.