pith. sign in

arxiv: 1907.04170 · v1 · pith:3SKREK44new · submitted 2019-07-09 · ⚛️ physics.comp-ph · cond-mat.stat-mech

Using data-reduction techniques to analyse biomolecular trajectories

Gareth A. Tribello , Piero Gasparotto This is my paper

Pith reviewed 2026-05-25 00:02 UTC · model grok-4.3

classification ⚛️ physics.comp-ph cond-mat.stat-mech
keywords dimensionality reductionmolecular dynamicsdiffusion mapssketch-mapbiomolecular trajectoriesenhanced samplingfree energy landscapes
0
0 comments X

The pith

Dimensionality reduction algorithms such as diffusion maps and sketch-map can organize and interpret high-dimensional molecular dynamics trajectories.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The chapter explains the operation of dimensionality reduction methods including diffusion maps and sketch-map when applied to molecular dynamics data. It covers their mathematical basis, practical choices such as selecting landmarks, and adaptations needed for data from enhanced sampling runs. Comparisons of the methods on example datasets are presented, followed by a survey of sketch-map uses across biomolecular problems and a note on emerging directions in the field. A reader would care because raw trajectory data from simulations is too voluminous to interpret directly, and these techniques aim to expose the low-dimensional manifolds that govern conformational changes.

Core claim

Dimensionality reduction algorithms embed the high-dimensional configurations sampled in a molecular dynamics trajectory into a lower-dimensional space while preserving key distances or diffusion properties, thereby allowing visualization of free-energy landscapes and identification of metastable states; the chapter details how diffusion maps and sketch-map achieve this embedding, how landmark selection and enhanced-sampling corrections are handled in practice, and how sketch-map in particular has been deployed on a range of biomolecular systems.

What carries the argument

Sketch-map and diffusion maps, which construct a low-dimensional embedding of trajectory frames by minimizing a stress function or using diffusion distances derived from a similarity kernel.

If this is right

  • Trajectory data from standard and enhanced-sampling molecular dynamics can be projected into two or three dimensions for visual inspection of conformational basins.
  • Landmark selection strategies allow the methods to scale to trajectories containing millions of frames.
  • Sketch-map embeddings have already been used to analyze folding, binding, and conformational transitions in multiple biomolecular systems.
  • The same embedding procedures can be combined with existing enhanced-sampling protocols to refine the collective variables used for further sampling.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The review framework could be extended to compare these methods against more recent manifold-learning or autoencoder approaches on the same benchmark trajectories.
  • If the low-dimensional embeddings reliably capture slow degrees of freedom, they could serve as input for constructing Markov state models without manual choice of order parameters.
  • Practical guidelines on landmark selection might generalize to other high-dimensional simulation domains such as materials or fluid systems.

Load-bearing premise

The algorithms behave as described in the referenced literature and can be applied to enhanced-sampling trajectories without generating artifacts that would misrepresent the underlying free-energy surface.

What would settle it

A direct comparison in which sketch-map or diffusion-map projections of an enhanced-sampling trajectory produce clusters or pathways that contradict the known reaction coordinate or free-energy profile obtained by independent means.

Figures

Figures reproduced from arXiv: 1907.04170 by Gareth A. Tribello, Piero Gasparotto.

Figure 1
Figure 1. Figure 1: Figure illustrating how we can use reweighting algorithms to extract [PITH_FULL_IMAGE:figures/full_fig_p007_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Figure illustrating the three possible representations of the data con [PITH_FULL_IMAGE:figures/full_fig_p010_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Figure illustrating a workflow that is often used when dimensionality [PITH_FULL_IMAGE:figures/full_fig_p016_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Figure showing how the various landmark selection algorithms per [PITH_FULL_IMAGE:figures/full_fig_p021_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Figure illustrating how the PCA algorithm works. Each of the black [PITH_FULL_IMAGE:figures/full_fig_p024_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Figure illustrating how PCA and isomap perform on model data. [PITH_FULL_IMAGE:figures/full_fig_p028_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: Figure illustrating the form of the data set that was used in the [PITH_FULL_IMAGE:figures/full_fig_p033_7.png] view at source ↗
Figure 8
Figure 8. Figure 8: Figure showing the projections of the data set that was introduced in [PITH_FULL_IMAGE:figures/full_fig_p035_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Figure illustrating the purpose of the sigmoid functions in sketch-map. [PITH_FULL_IMAGE:figures/full_fig_p038_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Figure illustrating the projection that is generated by sketch-map of [PITH_FULL_IMAGE:figures/full_fig_p041_10.png] view at source ↗
Figure 11
Figure 11. Figure 11: Projections of a parallel tempering trajectory of the C-terminal frag [PITH_FULL_IMAGE:figures/full_fig_p044_11.png] view at source ↗
Figure 12
Figure 12. Figure 12: Histograms illustrating the joint probability density function for the [PITH_FULL_IMAGE:figures/full_fig_p045_12.png] view at source ↗
Figure 13
Figure 13. Figure 13: A sketch-map projection for a parallel tempering trajectory of the [PITH_FULL_IMAGE:figures/full_fig_p053_13.png] view at source ↗
Figure 14
Figure 14. Figure 14: Figure showing the free energy surface at three different tempera [PITH_FULL_IMAGE:figures/full_fig_p055_14.png] view at source ↗
Figure 15
Figure 15. Figure 15: Figure illustrating the problems associated with using sketch-map [PITH_FULL_IMAGE:figures/full_fig_p061_15.png] view at source ↗
read the original abstract

This chapter discusses the way in which dimensionality reduction algorithms such as diffusion maps and sketch-map can be used to analyze molecular dynamics trajectories. The first part discusses how these various algorithms function, as well as practical issues such as landmark selection and how these algorithms can be used when the data to be analyzed, comes from enhanced sampling trajectories. In the later parts, a comparison between the results obtained by applying various algorithms to two sets of sample data is performed and discussed. This section is then followed by a summary of how one algorithm, in particular, sketch-map, has been applied to a range of problems. The chapter concludes with a discussion on the directions that we believe this field is currently moving.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 2 minor

Summary. This manuscript is a review chapter on applying dimensionality reduction algorithms such as diffusion maps and sketch-map to analyze molecular dynamics trajectories of biomolecules. It first explains the functioning of the algorithms along with practical considerations including landmark selection and use with enhanced sampling data; it then compares results from multiple algorithms on two sample datasets; this is followed by a survey of sketch-map applications across problems and a discussion of current and future directions in the field.

Significance. As a descriptive review that consolidates explanations of established methods, practical guidance, side-by-side comparisons on sample data, and an applications survey, the chapter could serve as a useful reference and educational resource for computational biophysicists and chemists. The explicit treatment of enhanced-sampling compatibility and landmark selection addresses common implementation questions. Because the work defers algorithmic details to the cited literature and presents no new derivations or large-scale empirical claims, its primary value lies in synthesis rather than novel theoretical or methodological advance.

minor comments (2)
  1. [Abstract] Abstract: the description of the comparison section states that results from 'various algorithms' are compared on 'two sets of sample data' but provides no indication of the systems or observables involved; a single sentence identifying the datasets would improve reader orientation without lengthening the abstract.
  2. [Conclusion] The manuscript refers to 'the directions that we believe this field is currently moving' in the conclusion; adding one or two concrete open questions or methodological gaps (with citations) would make the forward-looking discussion more actionable.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive summary of the manuscript and for recommending minor revision. No specific major comments were listed in the report, so we have no individual points requiring response or revision at this stage. The manuscript remains as submitted.

Circularity Check

0 steps flagged

No significant circularity in descriptive review

full rationale

This is a review chapter that summarizes the function of existing dimensionality-reduction methods (diffusion maps, sketch-map), practical considerations, performs comparisons on sample datasets, and surveys applications. It defers algorithmic correctness to the cited literature and introduces no new mathematical derivations, predictions, or fitted parameters. No load-bearing steps reduce to self-definition, fitted inputs renamed as predictions, or self-citation chains. The central content is descriptive discussion of established techniques.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

As a review chapter, the work relies on standard assumptions from the dimensionality reduction and molecular dynamics literature rather than introducing new free parameters, axioms, or entities. No new entities are postulated.

axioms (2)
  • domain assumption Dimensionality reduction algorithms such as diffusion maps and sketch-map preserve meaningful structure when applied to high-dimensional molecular trajectory data.
    Invoked throughout the discussion of how the algorithms function and their use on biomolecular trajectories.
  • domain assumption Enhanced sampling trajectories can be analyzed with the same dimensionality reduction techniques as standard MD trajectories.
    Stated in the section on practical issues with enhanced sampling data.

pith-pipeline@v0.9.0 · 5638 in / 1296 out tokens · 24761 ms · 2026-05-25T00:02:49.536608+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

84 extracted references · 84 canonical work pages

  1. [1]

    Andrew McCammon, Bruce R

    J. Andrew McCammon, Bruce R. Gelin, and Martin Karplus. Dynamics of folded proteins. Nature, 267:585, 1977

    work page 1977

  2. [2]

    D. J. Wales. Energy Landscapes. Cambridge University Press, 2003

    work page 2003

  3. [3]

    Friedman

    Jerome H. Friedman. On bias, variance, 0/1—loss, and the curse-of- dimensionality. Data Mining and Knowledge Discovery , 1(1):55–77, Mar 1997

    work page 1997

  4. [4]

    Amadei, A

    A. Amadei, A. B. M. Linssen, and H. J. C. Berendsen. Essential dynamics of proteins. PROTEINS: struct. funct. gen. , 17:412, 1993

    work page 1993

  5. [5]

    A. E. Garcia. Large-amplitude nonlinear motions in proteins. Phys. Rev. Lett., 68:2696–2699, 1992

    work page 1992

  6. [6]

    P. I. Zhuravlev, C. K. Materese, and G. A. Papoian. Deconstructing the na- tive state: Energy landscapes, function and dynamics of globular proteins. J. Phys. Chem. B , 113:8800–8812, 2009

    work page 2009

  7. [7]

    Nguyen, and Gerhard Stock

    Rainer Hegger, Alexandros Altis, Phuong H. Nguyen, and Gerhard Stock. How complex is the dynamics of peptide folding? Phys. Rev. Lett. , 98(2):028102, Jan 2007

    work page 2007

  8. [8]

    Es- timating the intrinsic dimension of datasets by a minimal neighborhood information

    Elena Facco, Maria d’Errico, Alex Rodriguez, and Alessandro Laio. Es- timating the intrinsic dimension of datasets by a minimal neighborhood information. Scientific Reports, 7:12140, 2017. 68 REFERENCES REFERENCES

    work page 2017

  9. [9]

    Kinetic distance and kinetic maps from molecular dynamics simulation

    Frank No´ e and Cecilia Clementi. Kinetic distance and kinetic maps from molecular dynamics simulation. Journal of Chemical Theory and Compu- tation, 11(10):5002–5011, 2015. PMID: 26574285

    work page 2015

  10. [10]

    Advillin folding takes place on a hy- persurface of small dimensionality

    Stefano Piana and Alessandro Laio. Advillin folding takes place on a hy- persurface of small dimensionality. Phys. Rev. Lett., 101(20):208101, 2008

    work page 2008

  11. [11]

    Borg and P

    I. Borg and P. J. F. Groenen. Modern Multidimensional Scaling: theory and applications. Springer, 2005

    work page 2005

  12. [12]

    I.T. Jolliffe. Principal Component Analysis. Springer, 2002

    work page 2002

  13. [13]

    An Introduction to Statistical Learning with applications in R

    Gareth James, Daniela Witten, Trevor Hastie, and Robert Tibshirani. An Introduction to Statistical Learning with applications in R . Springer, 2013

    work page 2013

  14. [14]

    Frenkel and B

    D. Frenkel and B. Smit. Understanding Molecular Simulation . Academic Press, 2002

    work page 2002

  15. [15]

    M. P. Allen and D. J. Tildesley. Computer simulation of liquids . Oxford University Press, USA, 1990

    work page 1990

  16. [16]

    A solution for the best rotation to relate two sets of vectors

    Wolfgang Kabsch. A solution for the best rotation to relate two sets of vectors. Acta Crystallographica Section A: Crystal Physics, Diffraction, Theoretical and General Crystallography, 32(5):922–923, 1976

    work page 1976

  17. [17]

    Tenenbaum, Vin de Silva, and John C

    Joshua B. Tenenbaum, Vin de Silva, and John C. Langford. A global geometric framework for nonlinear dimensionality reduction. Science, 290(5500):2319–2323, 2000

    work page 2000

  18. [18]

    de Silva and B

    V. de Silva and B. Tenenbaum. Sparse multidimensional scaling using landmark points, 2004. 69 REFERENCES REFERENCES

    work page 2004

  19. [19]

    Nonlin- ear component analysis as a kernel eigenvalue problem

    Bernhard Sch¨ olkopf, Alexander Smola, and Klaus-Robert M¨ uller. Nonlin- ear component analysis as a kernel eigenvalue problem. Neural Computa- tion, 10(5):1299–1319, 1998

    work page 1998

  20. [20]

    ArthurF. Voter. Introduction to the kinetic monte carlo method. In KurtE. Sickafus, EugeneA. Kotomin, and BlasP. Uberuaga, editors, Radiation Ef- fects in Solids , volume 235 of NATO Science Series, pages 1–23. Springer Netherlands, 2007

    work page 2007

  21. [21]

    Hochbaum and David B

    Dorit S. Hochbaum and David B. Shmoys. A Best Possible Heuristic for the k-Center Problem. MATHEMATICS OF OPERATIONS RESEARCH, 10(2):180–184, May 1985

    work page 1985

  22. [22]

    Tribello, and Michele Parrinello

    Michele Ceriotti, Gareth A. Tribello, and Michele Parrinello. Demonstrat- ing the transferability and the descriptive power of sketch-map. Jour- nal of Chemical Theory and Computation , 9(3):1521–1532, 2013. PMID: 26587614

    work page 2013

  23. [23]

    Barducci, G

    A. Barducci, G. Bussi, and M. Parrinello. Well tempered metadynamics: A smoothly converging and tunable free energy method. Phys. Rev. Lett., 100:020603, 2008

    work page 2008

  24. [24]

    Bonomi and M

    M. Bonomi and M. Parrinello. Enhanced sampling in the well-tempered ensemble. Phys. Rev. Lett., 104:190601, May 2010

    work page 2010

  25. [25]

    M. A. Balsera, W. Wriggers, Y. Oono, and K. Schulten. Principal com- ponent analysis and long time protein dynamics. The Journal of Physical Chemistry, 100(7):2567–2572, 1996

    work page 1996

  26. [26]

    Roweis and Lawrence K

    Sam T. Roweis and Lawrence K. Saul. Nonlinear dimensionality reduction by locally linear embedding. Science, 290(5500):2323–2326, 2000. 70 REFERENCES REFERENCES

    work page 2000

  27. [27]

    Kavraki, and Cecilia Clementi

    Payel Das, Mark Moll, Hern´ an Stamati, Lydia E. Kavraki, and Cecilia Clementi. Low-dimensional, free-energy landscapes of protein-folding reac- tions by nonlinear dimensionality reduction. Proc. Natl. Acad. Sci. USA , 103(26):9885–9890, 2006

    work page 2006

  28. [28]

    Erion Plaku, Hern´ an Stamati, Cecilia Clementi, and Lydia E. Kavraki. Fast and reliable analysis of molecular motion using proximity relations and di- mensionality reduction. Proteins: Structure, Function, and Bioinformatics, 67(4):897–907, 2007

    work page 2007

  29. [29]

    Hern´ an Stamati, Cecilia Clementi, and Lydia E. Kavraki. Application of nonlinear dimensionality reduction to characterize the conformational land- scape of small peptides. Proteins: Structure, Function, and Bioinformatics, 78(2):223–235, 2010

    work page 2010

  30. [30]

    Rohrdanz, Wenwei Zheng, Mauro Maggioni, and Cecilia Clementi

    Mary A. Rohrdanz, Wenwei Zheng, Mauro Maggioni, and Cecilia Clementi. Determination of reaction coordinates via locally scaled diffusion map. J. Chem. Phys., 134(12):124116, 2011

    work page 2011

  31. [31]

    Rohrdanz, Mauro Maggioni, and Cecilia Clementi

    Wenwei Zheng, Mary A. Rohrdanz, Mauro Maggioni, and Cecilia Clementi. Polymer reversal rate calculated via locally scaled diffusion map. J. Chem. Phys., 134(14):144109, 2011

    work page 2011

  32. [32]

    D. L. Donoho and C. Grimes. When does isomap recover the natural parameterization of familes of articulated images? Technical Report 2002- 27, Department of Statistics, Stanford University, 2002

    work page 2002

  33. [33]

    Donoho and Carrie Grimes

    David L. Donoho and Carrie Grimes. Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data. Proc. Natl. Acad. Sci. USA of the United States of America , 100(10):5591–5596, 2003. 71 REFERENCES REFERENCES

    work page 2003

  34. [34]

    Bronstein, Alexander M

    Guy Rosman, Michael M. Bronstein, Alexander M. Bronstein, and Ron Kimmel. Nonlinear dimensionality reduction by topologically constrained isometric embedding. International Journal of Computer Vision , 89:56–58, 2010

    work page 2010

  35. [35]

    E. W. Dijkstra. A note on two problems in connexion with graphs. Numer. Math., 1(1):269–271, December 1959

    work page 1959

  36. [36]

    Robert W. Floyd. Algorithm 97: Shortest path. Commun. ACM, 5(6):345–, June 1962

    work page 1962

  37. [37]

    R. R. Coifman, S. Lafon, A. B. Lee, M. Maggioni, B. Nadler, F. Warner, and S. W. Zucker. Geometric diffusions as a tool for harmonic analysis and structure definition of data: Multiscale methods. Proc. Natl. Acad. Sci. USA of the United States of America , 102(21):7432–7437, 2005

    work page 2005

  38. [38]

    Coifman and St´ ephane Lafon

    Ronald R. Coifman and St´ ephane Lafon. Diffusion maps. Appl. Comput. Harmon. Anal., 21(1):5 – 30, 2006

    work page 2006

  39. [39]

    Laplacian eigenmaps for dimensionality reduction and data representation

    Mikhail Belkin and Partha Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Comput., 15(6):1373–1396, 2003

    work page 2003

  40. [40]

    Ferguson, Athanassios Z

    Andrew L. Ferguson, Athanassios Z. Panagiotopoulos, Pablo G. Debenedetti, and Ioannis G. Kevrekidis. Systematic determination of order parameters for chain dynamics using diffusion maps. Proc. Natl. Acad. Sci. USA, 107(31):13597–13602, 2010

    work page 2010

  41. [41]

    Kevrekidis, and Ronald R

    Amit Singer, Radek Erban, Ioannis G. Kevrekidis, and Ronald R. Coif- man. Detecting intrinsic slow variables in stochastic dynamical systems by anisotropic diffusion maps. Proc. Natl. Acad. Sci. USA, 106(38):16090– 16095, 2009. 72 REFERENCES REFERENCES

    work page 2009

  42. [42]

    Rohrdanz, Wenwei Zheng, and Cecilia Clementi

    Mary A. Rohrdanz, Wenwei Zheng, and Cecilia Clementi. Discovering mountain passes via torchlight: Methods for the definition of reaction coor- dinates and pathways in complex macromolecular reactions.Annual Review of Physical Chemistry , 64(1):295–316, 2013. PMID: 23298245

    work page 2013

  43. [43]

    Laplacian eigenmaps for dimensionality reduction and data representation

    Mikhail Belkin and Partha Niyogi. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation, 15(6):1373–1396, 2003

    work page 2003

  44. [44]

    Visualizing data using t-sne

    Laurens van der Maaten and Geoffrey Hinton. Visualizing data using t-sne. Journal of Machine Learning Research , 9:2579–2605, 2008

    work page 2008

  45. [45]

    Tribello, and Michele Parrinello

    Michele Ceriotti, Gareth A. Tribello, and Michele Parrinello. Simplify- ing the representation of complex free-energy landscapes using sketch-map. Proc. Natl. Acad. Sci. USA , 108:13023–13029, 2011

    work page 2011

  46. [46]

    Tribello, Michele Ceriotti, and Michele Parrinello

    Gareth A. Tribello, Michele Ceriotti, and Michele Parrinello. Using sketch- map coordinates to analyze and bias molecular dynamics simulations.Proc. Natl. Acad. Sci. USA , 109(14):5196–5201, 2012

    work page 2012

  47. [47]

    Tribello, Michele Ceriotti, and Michele Parrinello

    Gareth A. Tribello, Michele Ceriotti, and Michele Parrinello. A self-learning algorithm for biased molecular dynamics. Proc. Natl. Acad. Sci. USA , 107(41):17509–17514, 2010

    work page 2010

  48. [48]

    P. N. Mortenson, D. A. Evans, and D. J. Wales. Energy landscapes of model polyalanines. J. Chem. Phys. , 117:1363, 2002

    work page 2002

  49. [49]

    Pedregosa, G

    F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Vanderplas, A. Pas- sos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay. Scikit- learn: Machine learning in Python. Journal of Machine Learning Research, 12:2825–2830, 2011. 73 REFERENCES REFERENCES

    work page 2011

  50. [50]

    Tribello, Michele Ceriotti, and Michele Par- rinello

    Albert Ardevol, Gareth A. Tribello, Michele Ceriotti, and Michele Par- rinello. Probing the unfolded configurations of a β-hairpin using sketch- map. Journal of Chemical Theory and Computation , 11(3):1086–1093,

    work page

  51. [51]

    Knowledge-based protein secondary structure assignment

    Dmitrij Frishman and Patrick Argos. Knowledge-based protein secondary structure assignment. Proteins: Structure, Function, and Bioinformatics , 23(4):566–579, 1995

    work page 1995

  52. [52]

    Energy landscape of a small peptide revealed by dihedral angle principal component analysis

    Mu Yuguang, Nguyen Phuong H., and Stock Gerhard. Energy landscape of a small peptide revealed by dihedral angle principal component analysis. Proteins: Structure, Function, and Bioinformatics , 58(1):45–52, 2005

    work page 2005

  53. [53]

    energy landscape of a small peptide re- vealed by dihedral angle principal component analysis

    Hinsen Konrad. Comment on: “energy landscape of a small peptide re- vealed by dihedral angle principal component analysis”. Proteins: Struc- ture, Function, and Bioinformatics , 64(3):795–797, 2006

    work page 2006

  54. [54]

    A collective variable for the efficient exploration of protein beta-sheet structures: Application to sh3 and gb1

    Fabio Pietrucci and Alessandro Laio. A collective variable for the efficient exploration of protein beta-sheet structures: Application to sh3 and gb1. Journal of Chemical Theory and Computation , 5(9):2197–2201, 2009

    work page 2009

  55. [55]

    A. K. Dunker, I. Silman, V. N. Uversky, and J. L. Sussman. Function and structure of inherently disordered proteins. Current Opinion in Structural Biology, 18:756–764, 2008

    work page 2008

  56. [56]

    Constanzi

    S. Constanzi. Modeling g protein-coupled receptors: a concrete possibility. Chim. Oggi., 28:26–31, 2010

    work page 2010

  57. [57]

    Goldfeld, Kai Zhu, Thijs Beuming, and Richard A

    Dahlia A. Goldfeld, Kai Zhu, Thijs Beuming, and Richard A. Friesner. Successful prediction of the intra- and extracellular loops of four g-protein- coupled receptors. Proceedings of the National Academy of Sciences , 108(20):8275–8280, 2011. 74 REFERENCES REFERENCES

    work page 2011

  58. [58]

    Structure predic- tion of the second extracellular loop in g-protein-coupled receptors

    Sebastian Kmiecik, Michal Jamroz, and Michal Kolinski. Structure predic- tion of the second extracellular loop in g-protein-coupled receptors. Bio- physical Journal, 106:2408 – 2416, 2015

    work page 2015

  59. [59]

    H. J. Dyson and P. E. Wright. Intrinsically unstructured proteins and their functions. Nature Reviews Molecular Cell Biology , 6:197–208, 2005

    work page 2005

  60. [60]

    Jonathan P. K. Doye, Mark A. Miller, and David J. Wales. The double- funnel energy landscape of the 38-atom lennard-jones cluster. J. Chem. Phys., 110(14):6896–6906, 1999

    work page 1999

  61. [61]

    J. P. Neirotti, F. Calvo, David L. Freeman, and J. D. Doll. Phase changes in 38-atom lennard-jones clusters. i. a parallel tempering study in the canon- ical ensemble. J. Chem. Phys. , 112(23):10340–10349, 2000

    work page 2000

  62. [62]

    Calvo, J

    F. Calvo, J. P. Neirotti, David L. Freeman, and J. D. Doll. Phase changes in 38-atom lennard-jones clusters. ii. a parallel tempering study of equilib- rium and dynamic properties in the molecular dynamics and microcanonical ensembl es. J. Chem. Phys. , 112(23):10350–10357, 2000

    work page 2000

  63. [63]

    D. J. Wales. Discrete path sampling. Mol. Phys., 100:3285–3306, 2002

    work page 2002

  64. [64]

    Free-energy landscape for β hairpin folding from combined par- allel tempering and metadynamics

    Giovanni Bussi, Francesco Luigi Gervasio, Alessandro Laio, and Michele Parrinello. Free-energy landscape for β hairpin folding from combined par- allel tempering and metadynamics. J. Chem. Am. Soc. , 128(41):13435– 13441, 2006. PMID: 17031956

    work page 2006

  65. [65]

    Berman, J

    H.M. Berman, J. Westbrook, Z. Feng, G. Gilliland, T.N. Bhat, H. Weissig, I.N. Shindyalov, and P.E. Bourne. The protein data bank. Nucleic Acids Research, 28:235–242, 200

    work page

  66. [66]

    Berman, K

    H.M. Berman, K. Henrick, and H. Nakamura. Announcing the worldwide protein data bank. Nature Structural Biology, 10:980, 2003. 75 REFERENCES REFERENCES

    work page 2003

  67. [67]

    Rose, Andreas Prlic, Ali Altunkaya, Chunxiao Bi, Anthony R

    Peter W. Rose, Andreas Prlic, Ali Altunkaya, Chunxiao Bi, Anthony R. Bradley, Cole H. Christie, Luigi Di Costanzo, Jose M. Duarte, Shuchismita Dutta, Zukang Feng, Rachel Kramer Green, David S. Goodsell, Brian Hud- son, Tara Kalro, Robert Lowe, Ezra Peisach, Christopher Randle, Alexan- der S. Rose, Chenghua Shao, Yi-Ping Tao, Yana Valasatava, Maria Voigt, ...

    work page 2017

  68. [68]

    Tribello, and Michele Par- rinello

    Albert Ardevol, Ferruccio Palazzesi, Gareth A. Tribello, and Michele Par- rinello. General protein data bank-based collective variables for protein folding. Journal of Chemical Theory and Computation , 12(1):29–35, 2016. PMID: 26632859

    work page 2016

  69. [69]

    Using dimensionality reduction to systematically expand conformational sampling of intrinsically disordered peptides

    Oleksandra Kukharenko, Kevin Sawade, Jakob Steuer, and Christine Peter. Using dimensionality reduction to systematically expand conformational sampling of intrinsically disordered peptides. Journal of Chemical Theory and Computation, 12(10):4726–4734, 2016. PMID: 27588692

    work page 2016

  70. [70]

    Laio and M

    A. Laio and M. Parrinello. Escaping free-energy minima. Proc. Natl. Acad. Sci. USA, 99(20):12562–12566, 2002

    work page 2002

  71. [71]

    Metadynamics in essential coordinates: Free energy simulation of conformational changes

    Vojtˇ ech Spiwok, Petra Lipovov´ a, and Blanka Kr´ alov´ a. Metadynamics in essential coordinates: Free energy simulation of conformational changes. The Journal of Physical Chemistry B , 111(12):3073–3076, 2007. PMID: 17388445

    work page 2007

  72. [72]

    Com- paring the efficiency of biased and unbiased molecular dynamics in recon- 76 REFERENCES REFERENCES structing the free energy landscape of met-enkephalin

    Ludovico Sutto, Marco D’Abramo, and Francesco Luigi Gervasio. Com- paring the efficiency of biased and unbiased molecular dynamics in recon- 76 REFERENCES REFERENCES structing the free energy landscape of met-enkephalin. Journal of Chemical Theory and Computation , 6(12):3640–3646, 2010

    work page 2010

  73. [73]

    Metadynamics in the conforma- tional space nonlinearly dimensionally reduced by isomap

    Vojtech Spiwok and Blanka Kralova. Metadynamics in the conforma- tional space nonlinearly dimensionally reduced by isomap. J. Chem. Phys., 135(22):224504, 2011

    work page 2011

  74. [74]

    Recognizing molecular patterns by machine learning: An agnostic structural definition of the hydrogen bond

    Piero Gasparotto and Michele Ceriotti. Recognizing molecular patterns by machine learning: An agnostic structural definition of the hydrogen bond. The Journal of Chemical Physics , 141(17):174110, 2014

    work page 2014

  75. [75]

    Recog- nizing local and global structural motifs at the atomic scale

    Piero Gasparotto, Robert Horst Meißner, and Michele Ceriotti. Recog- nizing local and global structural motifs at the atomic scale. Journal of Chemical Theory and Computation, 14(2):486–498, 2018. PMID: 29298385

    work page 2018

  76. [76]

    Bartok, Gabor Csanyi, and Michele Ceriotti

    Sandip De, Albert P. Bartok, Gabor Csanyi, and Michele Ceriotti. Com- paring molecules and solids across structural and alchemical space. Phys. Chem. Chem. Phys. , 18:13754–13769, 2016

    work page 2016

  77. [77]

    Campbell, Graeme M

    Felix Musil, Sandip De, Jack Yang, Joshua E. Campbell, Graeme M. Day, and Michele Ceriotti. Machine learning for the structure-energy-property landscapes of molecular crystals. Chem. Sci., 9:1289–1300, 2018

    work page 2018

  78. [78]

    Chen and A

    W. Chen and A. L Ferguson. Molecular enhanced sampling with autoen- coders: On-the-fly collective variable discovery and accelerated free energy landscape exploration. ArXiv e-prints, December 2018

    work page 2018

  79. [79]

    M. M. Sultan, H. K. Wayment-Steele, and V. S. Pande. Transferable neu- ral networks for enhanced sampling of protein dynamics. ArXiv e-prints, January 2018. 77 REFERENCES REFERENCES

    work page 2018

  80. [80]

    Bowman, Vijay S

    Gregory R. Bowman, Vijay S. Pande, and Frank No´ e. An introduction to markov state models and their application to long timescale molecular simulation. In Advances in Experimental Medicine and Biology , 2014

    work page 2014

Showing first 80 references.