Protein Folding, the Levinthal Paradox and Rapidly Mixing Markov Chains

Authors:
Peter Clote
Affiliations:
-
Venue:
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Year:
1999

Citing 2
Cited 1

Algorithms for random generation and counting: a Markov chain approach

Algorithms for random generation and counting: a Markov chain approach
Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Effect of increasing the energy gap between the two lowest energy states on the mixing time of the Metropolis algorithm

Information Processing Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract