ArticleThe Journal of chemical physics2013
Analyzing milestoning networks for molecular kinetics: definitions, algorithms, and examples.
Article in The Journal of chemical physics, 2013. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 11 papers.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
11 citing papers in PubMed.
- Helix Folding in One Dimension: Effects of Proline Co-Solvent on Free Energy Landscape of Hydrogen Bond Dynamics in Alanine Peptides.Life (Basel, Switzerland) · 2025Article
- ScMiles2: A Script to Conduct and Analyze Milestoning Trajectories for Long Time Dynamics.Journal of chemical theory and computation · 2022Article
- Peptide Permeation across a Phosphocholine Membrane: An Atomically Detailed Mechanism Determined through Simulations and Supported by Experimentation.The journal of physical chemistry. B · 2022Article
- Computer Simulations of the Dissociation Mechanism of Gleevec from Abl Kinase with Milestoning.The journal of physical chemistry. B · 2021Article
- Value of Temporal Information When Analyzing Reaction Coordinates.Journal of chemical theory and computation · 2020Article
- The transition between active and inactive conformations of Abl kinase studied by rock climbing and Milestoning.Biochimica et biophysica acta. General subjects · 2020Article
- Rock climbing: A local-global algorithm to compute minimum energy and minimum free energy pathways.The Journal of chemical physics · 2017Article
- Calculating Iso-Committor Surfaces as Optimal Reaction Coordinates with Milestoning.Entropy (Basel, Switzerland) · 2017Article
- Extracting intrinsic dynamic parameters of biomolecular folding from single-molecule force spectroscopy experiments.Protein science : a publication of the Protein Society · 2016Article
- Exact milestoning.The Journal of chemical physics · 2015Article
- Modeling kinetics and equilibrium of membranes with fields: milestoning analysis and implication to permeation.The Journal of chemical physics · 2014Article
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
4 authors.
Funding
Abstract
Network representations are becoming increasingly popular for analyzing kinetic data from techniques like Milestoning, Markov State Models, and Transition Path Theory. Mapping continuous phase space trajectories into a relatively small number of discrete states helps in visualization of the data and in dissecting complex dynamics to concrete mechanisms. However, not only are molecular networks derived from molecular dynamics simulations growing in number, they are also getting increasingly complex, owing partly to the growth in computer power that allows us to generate longer and better converged trajectories. The increased complexity of the networks makes simple interpretation and qualitative insight of the molecular systems more difficult to achieve. In this paper, we focus on various network representations of kinetic data and algorithms to identify important edges and pathways in these networks. The kinetic data can be local and partial (such as the value of rate coefficients between states) or an exact solution to kinetic equations for the entire system (such as the stationary flux between vertices). In particular, we focus on the Milestoning method that provides fluxes as the main output. We proposed Global Maximum Weight Pathways as a useful tool for analyzing molecular mechanism in Milestoning networks. A closely related definition was made in the context of Transition Path Theory. We consider three algorithms to find Global Maximum Weight Pathways: Recursive Dijkstra's, Edge-Elimination, and Edge-List Bisection. The asymptotic efficiency of the algorithms is analyzed and numerical tests on finite networks show that Edge-List Bisection and Recursive Dijkstra's algorithms are most efficient for sparse and dense networks, respectively. Pathways are illustrated for two examples: helix unfolding and membrane permeation. Finally, we illustrate that networks based on local kinetic information can lead to incorrect interpretation of molecular mechanisms.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.