Abstract
Analysis of secondary structure transition is important for designing bistable DNA/RNA molecules. To make reliable molecular machines out of such molecules, it is necessary to estimate the height of the energy barrier to the structure transition. This paper suggests three kinds of optimized transition path: the locally optimized direct path, the globally optimized direct path, and the globally optimized path. These paths can be used as criteria for evaluating structure transitions. Then, we introduce algorithms to obtain or approximate these optimized paths. The algorithm that Morgan and Higgs used to obtain the globally optimized direct path is analyzed and improved as an algorithm on a bipartite graph. The algorithms are implemented as a C language program.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Flamm, C., et al.: RNA folding at elementary step resolution. RNA 6, 325–338 (2000)
Hofacker, I.L., et al.: Fast folding and comparison of RNA secondary structures. Monatshefte für Chemie (Chemical Monthly) 125, 167–188 (1994)
Morgan, S.R., et al.: Barrier heights between ground states in a model of RNA secondary structure. J. Phys. A: Math. Gen. 31, 3153–3170 (1998)
Uejima, H., et al.: Secondary Structure Design of Multi-state DNA Machine Based on Sequential Structure Transitions. In: Chen, J., Reif, J.H. (eds.) DNA 2003. LNCS, vol. 2943, pp. 74–85. Springer, Heidelberg (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Uejima, H., Hagiya, M. (2004). Analyzing Secondary Structure Transition Paths of DNA/RNA Molecules. In: Chen, J., Reif, J. (eds) DNA Computing. DNA 2003. Lecture Notes in Computer Science, vol 2943. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24628-2_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-24628-2_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20930-0
Online ISBN: 978-3-540-24628-2
eBook Packages: Springer Book Archive