A multi-directional rapidly exploring random graph (mRRG) for protein folding

Handle URI:
http://hdl.handle.net/10754/597319
Title:
A multi-directional rapidly exploring random graph (mRRG) for protein folding
Authors:
Nath, Shuvra Kanti; Thomas, Shawna; Ekenna, Chinwe; Amato, Nancy M.
Abstract:
Modeling large-scale protein motions, such as those involved in folding and binding interactions, is crucial to better understanding not only how proteins move and interact with other molecules but also how proteins misfold, thus causing many devastating diseases. Robotic motion planning algorithms, such as Rapidly Exploring Random Trees (RRTs), have been successful in simulating protein folding pathways. Here, we propose a new multi-directional Rapidly Exploring Random Graph (mRRG) specifically tailored for proteins. Unlike traditional RRGs which only expand a parent conformation in a single direction, our strategy expands the parent conformation in multiple directions to generate new samples. Resulting samples are connected to the parent conformation and its nearest neighbors. By leveraging multiple directions, mRRG can model the protein motion landscape with reduced computational time compared to several other robotics-based methods for small to moderate-sized proteins. Our results on several proteins agree with experimental hydrogen out-exchange, pulse-labeling, and F-value analysis. We also show that mRRG covers the conformation space better as compared to the other computation methods. Copyright © 2012 ACM.
Citation:
Nath SK, Thomas S, Ekenna C, Amato NM (2012) A multi-directional rapidly exploring random graph (mRRG) for protein folding. Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine - BCB ’12. Available: http://dx.doi.org/10.1145/2382936.2382942.
Publisher:
Association for Computing Machinery (ACM)
Journal:
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine - BCB '12
KAUST Grant Number:
KUS-C1-016-04
Issue Date:
2012
DOI:
10.1145/2382936.2382942
Type:
Conference Paper
Sponsors:
This work is supported in part by NSF awards CRI-0551685, CCF-0833199, CCF-0830753, IIS-096053, IIS-0917266 by THECB NHARP award 000512-0097-2009, byChevron, IBM, Intel, Oracle/Sun and by Award KUS-C1-016-04, made by King Abdullah University of Science andTechnology (KAUST).
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorNath, Shuvra Kantien
dc.contributor.authorThomas, Shawnaen
dc.contributor.authorEkenna, Chinween
dc.contributor.authorAmato, Nancy M.en
dc.date.accessioned2016-02-25T12:30:36Zen
dc.date.available2016-02-25T12:30:36Zen
dc.date.issued2012en
dc.identifier.citationNath SK, Thomas S, Ekenna C, Amato NM (2012) A multi-directional rapidly exploring random graph (mRRG) for protein folding. Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine - BCB ’12. Available: http://dx.doi.org/10.1145/2382936.2382942.en
dc.identifier.doi10.1145/2382936.2382942en
dc.identifier.urihttp://hdl.handle.net/10754/597319en
dc.description.abstractModeling large-scale protein motions, such as those involved in folding and binding interactions, is crucial to better understanding not only how proteins move and interact with other molecules but also how proteins misfold, thus causing many devastating diseases. Robotic motion planning algorithms, such as Rapidly Exploring Random Trees (RRTs), have been successful in simulating protein folding pathways. Here, we propose a new multi-directional Rapidly Exploring Random Graph (mRRG) specifically tailored for proteins. Unlike traditional RRGs which only expand a parent conformation in a single direction, our strategy expands the parent conformation in multiple directions to generate new samples. Resulting samples are connected to the parent conformation and its nearest neighbors. By leveraging multiple directions, mRRG can model the protein motion landscape with reduced computational time compared to several other robotics-based methods for small to moderate-sized proteins. Our results on several proteins agree with experimental hydrogen out-exchange, pulse-labeling, and F-value analysis. We also show that mRRG covers the conformation space better as compared to the other computation methods. Copyright © 2012 ACM.en
dc.description.sponsorshipThis work is supported in part by NSF awards CRI-0551685, CCF-0833199, CCF-0830753, IIS-096053, IIS-0917266 by THECB NHARP award 000512-0097-2009, byChevron, IBM, Intel, Oracle/Sun and by Award KUS-C1-016-04, made by King Abdullah University of Science andTechnology (KAUST).en
dc.publisherAssociation for Computing Machinery (ACM)en
dc.subjectAlgorithmsen
dc.titleA multi-directional rapidly exploring random graph (mRRG) for protein foldingen
dc.typeConference Paperen
dc.identifier.journalProceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine - BCB '12en
dc.contributor.institutionTexas A and M University, College Station, United Statesen
kaust.grant.numberKUS-C1-016-04en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.