### Abstract

Assuming that the dynamics of peptides and proteins can be described by Markov transitions between different configurational states, we present a method which can calculate the mean first passage time (MFPT) between sets of initial and final states. The method is described in detail and differences between this and a method commonly employed [1] are explained. It is shown that the proposed method is (i) more general in allowing sets of final states, (ii) significantly faster, (iii) more accurate since it does not involve the calculation of infinite summations. Particular attention is given to the biologically important case of multiple final states.

Original language | English |
---|---|

Pages (from-to) | 150-157 |

Number of pages | 8 |

Journal | AIP Conference Proceedings |

Volume | 940 |

DOIs | |

Publication status | Published - 1 Dec 2007 |

Event | 3rd International Symposium on Computational Life Science, CompLife 2007 - Utrecht, Netherlands Duration: 4 Oct 2007 → 5 Oct 2007 |

### Bibliographical note

Copyright © 2007, AIP Publishing. AIP Conference Proceedings 940, 150 (2007); doi: 10.1063/1.2793397## Fingerprint Dive into the research topics of 'Calculating mean first passage times from Markov models of proteins'. Together they form a unique fingerprint.

## Cite this

*AIP Conference Proceedings*,

*940*, 150-157. https://doi.org/10.1063/1.2793397