# A Local Search Based Barrier Height Estimation Algorithm for DNA Molecular Transitions

## Abstract

An accurate estimation of the barrier height between two given secondary structures of DNA molecules is known to be a fundamental and difficult problem. In 1998 Morgan and Higgs proposed a heuristic algorithm based on the shortest path between the two structures, and in DNA 10, Kubota and Hagiya did an exact algorithm based on the flooding. The former runs in a practical time for sufficiently large length *n* of molecule and would always show a good performance if the barrier always appeared near the shortest path. The only but crucial drawback of the latter on the other hand is that it cannot run for a large *n*; we found an instance of even length *n* = 46 for which the run did not complete because of the memory. In this paper we formulate it as an optimization problem, and then propose a new heuristic algorithm based on the local search strategy. We use the Morgan and Higgs’ heuristics as the engine to find a locally optimal solution, and based on the local search paradigm, we repeat this local search starting from the solution of the previous local search, with the hope that this sequence of improvements will eventually reach the optimum solution. We also discuss some techniques to improve the performance. We demonstrate that for size about 200, our algorithm runs in 5 seconds, and for many of the cases (13 cases out of 16) in which the Kubota and Hagiya’s algorithm can complete, our algorithm exactly answers the optimum values.

## Keywords

Short Path Local Search Energy Barrier Initial Structure Neighborhood Search## Preview

Unable to display preview. Download preview PDF.

## References

- 1.Aarts, E.H.L., Lenstra, J.K. (eds.): Local Search in Combinatorial Optimization. Wiley, Chichester (1997)MATHGoogle Scholar
- 2.Cupal, J., Flamm, C., Stadler, P.F.: Density of States, Metastable States, and Saddle Points Exploring the Energy Landscape of an RNA Molecule. In: ISMB 1997, pp. 88–91 (1997)Google Scholar
- 3.Hagiya, M.: Towards Molecular Programming. In: Ciobanu, G., Rozenberg, G. (eds.) Modelling in Molecular Biology. Natural Computing Series, pp. 125–140. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 4.Hofacker, I.L., Fontana, W., Stadler, P.F., Bonhoeffer, S., Tacker, M., Schuster, P.: Schuster Fast Folding and Comparison of RNA Secondary Structures. Monatsh. Chem. 125, 167–188 (1994)CrossRefGoogle Scholar
- 5.Kubota, M., Hagiya, M.: Minimum Basin Algorithm: An Effective Analysis Technique for DNA Energy Landscapes. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 202–214. Springer, Heidelberg (2005)CrossRefGoogle Scholar
- 6.Kubota, M., Ohtake, K., Komiya, K., Sakamoto, K., Hagiya, M.: Branching DNA Machines Based on Transitions of Hairpin Structures. In: CEC 2003, pp. 2542–2548 (2003)Google Scholar
- 7.Morgan, S.R., Higgs, P.G.: Barrier heights between ground states in a model of RNA secondary structure. J. Phys. A: Math. Gen. 31, 3153–3170 (1998)CrossRefMATHGoogle Scholar
- 8.Stadler, P.F., Flamm, C.: Barrier Trees on Poset-Valued Landscapes. J. Gen. Prog. Evol. Machines 4, 7–20 (2003)CrossRefMATHGoogle Scholar
- 9.Uejima, H., Hagiya, M.: Secondary Structure Design of Multi-state DNA Machine Based on Sequential Structure Transitions. In: Chen, J., Reif, J.H. (eds.) DAN 2003. LNCS, vol. 2943, pp. 74–85. Springer, Heidelberg (2004)CrossRefGoogle Scholar
- 10.Yagiura, M., Ibaraki, T.: On Metaheuristic Algorithms for Combinatorial Optimization Problems. Systems and Computers in Japan 32(3), 33–55 (2001)CrossRefGoogle Scholar
- 11.Yagiura, M., Yamaguchi, T., Ibaraki, T.: A Variable Depth Search Algorithm for the Generalized Assignment Problem. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 459–471. Kluwer Acad. Publ., Dordrecht (1999)CrossRefGoogle Scholar
- 12.Yurke, B., Turberfield, A.J., Mills Jr., A.P., Simmel, F.C., Neumann, J.L.: A DNA-fuelled molecular machine made of DNA. Nature 406, 605–608 (2000)CrossRefGoogle Scholar