Evidence map›Paper›PMID 24206285›Full record

ArticleThe Journal of chemical physics2013

Analyzing milestoning networks for molecular kinetics: definitions, algorithms, and examples.

Shruthi Viswanath, Steven M Kreuzer, Alfredo E Cardenas, Ron Elber

Abstract read
In one paragraph

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.

0numbers the graph read from it
0cells of the map it votes in
11citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

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.

2 · The registry

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.

3 · Its place in the literature

Who cites it

11 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Article
  5. Value of Temporal Information When Analyzing Reaction Coordinates.Journal of chemical theory and computation · 2020
    Article
  6. Article
  7. Article
  8. Article
  9. Article
  10. Exact milestoning.The Journal of chemical physics · 2015
    Article
  11. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Shruthi ViswanathDepartment of Computer Science, University of Texas at Austin, Austin, Texas 78712, USA.
Steven M Kreuzer
Alfredo E Cardenas
Ron Elber

Funding

LONG TIME DYNAMICS OF BIOMOLECULESR01GM059796 · NIGMS · UNIVERSITY OF TEXAS AT AUSTIN · PI ELBER, RON · 2000 to 2021
$5.7M
NIGMS NIH HHS GM059796NIGMS NIH HHS R01 GM059796
6 · The paper itself

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

AlgorithmsMolecular Dynamics SimulationKinetics

Identifiers

PMID24206285
PMCPMC3838425

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

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.