loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2005 IEEE Computational Systems Bioinformatics Conference - Workshops (CSBW'05)
Efficient Sampling of Protein Folding Pathways using HMMSTR and Efficient Sampling of Protein Folding Pathways using HMMSTR and
Stanford, California
August 08-August 11
ISBN: 0-7695-2442-7
Yogesh A. Girdhar, Dept. of Computer Science,Rensselaer Polytechnic Institute
Srinivas Akella, Dept. of Computer Science,Rensselaer Polytechnic Institute
Srinivas Akella Srinivas Akella, Biology, Rensselaer Polytechnic Institute, Troy,

We present a method for constructing thousands of compact protein conformations from fragments and then connecting these structures to form a network of physically plausible folding pathways. This is the first attempt to merge the previous successes in fragment assembly methods with probabilistic roadmap (PRM) [2] methods. Previous PRM methods have used the knowledge of the true structure to sample conformational space. Our method uses only the amino acid sequence to bias the conformational sampling. Conformational sampling is done using HMMSTR [1], a hidden Markov model for local sequence-structure correlations. We then build a PRM graph and find paths that have the the lowest energy climb. We find that favored folding pathways exist, corresponding to deep valleys in the energy landscape. We describe the pathways for three small proteins with different secondary structure content in the context of a folding funnel model.

Citation:
Yogesh A. Girdhar, Srinivas Akella, Srinivas Akella Srinivas Akella, "Efficient Sampling of Protein Folding Pathways using HMMSTR and Efficient Sampling of Protein Folding Pathways using HMMSTR and," csbw, pp.222-223, 2005 IEEE Computational Systems Bioinformatics Conference - Workshops (CSBW'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.