Everything about Stochastic roadmap simulation

🧭 Start here: a 6-step reading path

1. Read the overview: Stochastic roadmap simulationA 5-minute orientation
2. Read the landmark paper: Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular MotionCited 67 times
3. Go sideways: Jean-Claude LatombeA closely related topic
4. Go sideways: Probabilistic roadmapA closely related topic

🏆 Landmark papers (most cited)

• Stochastic Roadmap Simulation: An Efficient Representation and Algorithm for Analyzing Molecular Motion

  Mehmet Serkan Apaydin, Douglas L. Brutlag, Carlos Guestrin · 2003 · Journal of Computational Biology · 67 citations

• Using Stochastic Roadmap Simulation to Predict Experimental Quantities in Protein Folding Kinetics: Folding Rates and Phi-Values

  Tsung-Han Chiang, Mehmet Serkan Apaydin, Douglas L. Brutlag · 2007 · Journal of Computational Biology · 23 citations

• Stochastic roadmap simulation for the study of ligand-protein interactions

  Mehmet Serkan Apaydın, Carlos E. Guestrin, Chris Varma · 2002 · Bioinformatics · 20 citations

📚 Books worth reading

Open Library didn't respond; try again in a moment.

🔗 Related topics

• Jean-Claude Latombe Jean-Claude Latombe (born May 14, 1947) is a French-American roboticist and the Kumagai Professor Emeritus in the School of Engineering at Stanford University…
• Probabilistic roadmap The probabilistic roadmap planner is a motion planning algorithm in robotics, which solves the problem of determining a path between a starting configuration…
• Motion planning Motion planning, also path planning (also known as the navigation problem or the piano mover's problem) is a computational problem to find a sequence of…
• Canadian traveller problem In computer science and graph theory, the Canadian traveller problem (CTP) is a generalization of the shortest path problem to graphs that are partially…
• Stochastic block model The stochastic block model is a generative model for random graphs. This model tends to produce graphs containing communities, subsets of nodes characterized…
• Direct simulation Monte Carlo Direct simulation Monte Carlo (DSMC) method uses probabilistic Monte Carlo simulation to solve the Boltzmann equation for finite Knudsen number fluid flows…
• Probabilistic context-free grammar In theoretical linguistics and computational linguistics, probabilistic context free grammars (PCFGs) extend context-free grammars, similar to how hidden…
• Gillespie algorithm In probability theory and computational science, the Gillespie algorithm, also known as the stochastic simulation algorithm (SSA), is a method for generating…