These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
172 related articles for article (PubMed ID: 34271741)
1. Graph transformation and shortest paths algorithms for finite Markov chains. Sharpe DJ; Wales DJ Phys Rev E; 2021 Jun; 103(6-1):063306. PubMed ID: 34271741 [TBL] [Abstract][Full Text] [Related]
2. Numerical analysis of first-passage processes in finite Markov chains exhibiting metastability. Sharpe DJ; Wales DJ Phys Rev E; 2021 Jul; 104(1-2):015301. PubMed ID: 34412280 [TBL] [Abstract][Full Text] [Related]
3. Nearly reducible finite Markov chains: Theory and algorithms. Sharpe DJ; Wales DJ J Chem Phys; 2021 Oct; 155(14):140901. PubMed ID: 34654307 [TBL] [Abstract][Full Text] [Related]
4. Optimal dimensionality reduction of Markov chains using graph transformation. Kannan D; Sharpe DJ; Swinburne TD; Wales DJ J Chem Phys; 2020 Dec; 153(24):244108. PubMed ID: 33380101 [TBL] [Abstract][Full Text] [Related]
5. Efficient and exact sampling of transition path ensembles on Markovian networks. Sharpe DJ; Wales DJ J Chem Phys; 2020 Jul; 153(2):024121. PubMed ID: 32668926 [TBL] [Abstract][Full Text] [Related]
6. Graph transformation method for calculating waiting times in Markov chains. Trygubenko SA; Wales DJ J Chem Phys; 2006 Jun; 124(23):234110. PubMed ID: 16821910 [TBL] [Abstract][Full Text] [Related]
7. Stable and scalable computation of state visitation probabilities in finite Markov chains. Sharpe DJ; Wales DJ J Chem Phys; 2023 Jun; 158(21):. PubMed ID: 37272567 [TBL] [Abstract][Full Text] [Related]
8. Path summation formulation of the master equation. Sun SX Phys Rev Lett; 2006 Jun; 96(21):210602. PubMed ID: 16803224 [TBL] [Abstract][Full Text] [Related]
9. The mean shape of transition and first-passage paths. Kim WK; Netz RR J Chem Phys; 2015 Dec; 143(22):224108. PubMed ID: 26671359 [TBL] [Abstract][Full Text] [Related]
10. An Efficient Path Classification Algorithm Based on Variational Autoencoder to Identify Metastable Path Channels for Complex Conformational Changes. Qiu Y; O'Connor MS; Xue M; Liu B; Huang X J Chem Theory Comput; 2023 Jul; 19(14):4728-4742. PubMed ID: 37382437 [TBL] [Abstract][Full Text] [Related]
11. Transition path sampling for discrete master equations with absorbing states. Eidelson N; Peters B J Chem Phys; 2012 Sep; 137(9):094106. PubMed ID: 22957554 [TBL] [Abstract][Full Text] [Related]
12. Decoding HMMs using the k best paths: algorithms and applications. Brown DG; Golod D BMC Bioinformatics; 2010 Jan; 11 Suppl 1(Suppl 1):S28. PubMed ID: 20122200 [TBL] [Abstract][Full Text] [Related]
14. Analysing ill-conditioned Markov chains. Woods EJ; Kannan D; Sharpe DJ; Swinburne TD; Wales DJ Philos Trans A Math Phys Eng Sci; 2023 Jul; 381(2250):20220245. PubMed ID: 37211032 [TBL] [Abstract][Full Text] [Related]
15. Computing the optimal path in stochastic dynamical systems. Bauver M; Forgoston E; Billings L Chaos; 2016 Aug; 26(8):083101. PubMed ID: 27586597 [TBL] [Abstract][Full Text] [Related]
16. A minimization principle for transition paths of maximum flux for collective variables. Skeel RD; Zhao R; Post CB Theor Chem Acc; 2017 Jan; 136():. PubMed ID: 29225509 [TBL] [Abstract][Full Text] [Related]
17. MELD-Path Efficiently Computes Conformational Transitions, Including Multiple and Diverse Paths. Perez A; Sittel F; Stock G; Dill K J Chem Theory Comput; 2018 Apr; 14(4):2109-2116. PubMed ID: 29547695 [TBL] [Abstract][Full Text] [Related]
18. The Edge-Disjoint Path Problem on Random Graphs by Message-Passing. Altarelli F; Braunstein A; Dall'Asta L; De Bacco C; Franz S PLoS One; 2015; 10(12):e0145222. PubMed ID: 26710102 [TBL] [Abstract][Full Text] [Related]
19. Randomized shortest-path problems: two related models. Saerens M; Achbany Y; Fouss F; Yen L Neural Comput; 2009 Aug; 21(8):2363-404. PubMed ID: 19323635 [TBL] [Abstract][Full Text] [Related]