Skip Navigation

This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow FREE Full Text (Screen PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Apaydin, M. S.
Right arrow Articles by Latombe, J.-C.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Apaydin, M. S.
Right arrow Articles by Latombe, J.-C.
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Bioinformatics Vol. 18 no. 90002 2002
Pages S18-S26
© 2002 Oxford University Press

Stochastic roadmap simulation for the study of ligand-protein interactions

Mehmet Serkan Apaydin 1, Carlos E. Guestrin 1, Chris Varma 1, Douglas L. Brutlag 2 and Jean-Claude Latombe 1

1 Department of Computer Science
2 Department of Biochemistry, Stanford University, Stanford CA 94305, USA

Understanding the dynamics of ligand-protein interactions is indispensable in the design of novel therapeutic agents. In this paper, we establish the use of Stochastic Roadmap Simulation (SRS) for the study of ligand-protein interactions through two studies. In our first study, we measure the effects of mutations on the catalytic site of a protein, a process called computational mutagenesis. In our second study, we focus on distinguishing the catalytic site from other putative binding sites. SRS compactly represents many Monte Carlo (MC) simulation paths in a compact graph structure, or roadmap. Furthermore, SRS allows us to analyze all the paths in this roadmap simultaneously. In our application of SRS to the domain of ligand-protein interactions, we consider a new parameter called escape time, the expected number of MC simulation steps required for the ligand to escape from the ‘funnel of attraction‘ of the binding site, as a metric for analyzing such interactions. Although computing escape times would probably be infeasible with MC simulation, these computations can be performed very efficiently with SRS. Our results for six mutant complexes for the first study and seven ligand-protein complexes for the second study, are very promising: In particular, the first results agree well with the biological interpretation of the mutations, while the second results show that escape time is a good metric to distinguish the catalytic site for five out of seven complexes.

Contact: apaydin{at}cs.stanford.edu guestrin{at}cs.stanford.edu latombe{at}cs.stanford.edu varma{at}cs.stanford.edu brutlag{at}stanford.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Protein Sci.Home page
A. A. Canutescu and R. L. Dunbrack Jr.
Cyclic coordinate descent: A robotics algorithm for protein loop closure
Protein Sci., May 1, 2003; 12(5): 963 - 972.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.