It is a well known fact that the behavior of simulated annealing algorithms is tightly related to the hierarchical decomposition of their configuration spaces in cycles. We here apply the iterative routine invented by Wentzell and Freidlin to construct the cycle decomposition of small RNA configuration spaces, for instance, hairpins. We furthermore explore the relationships of cycles and the barrier tree of the energy landscape. |
![]() |