Abstract
\(p\ {\overset{x}{\rightarrow}}\ q\) This paper discusses a problem of checking the structure freeness of DNA and RNA sequences. A set R of sequences over Σ is said to be structure free if for every α ∈ R, the minimum free energy of α is greater than or equal to 0. It was open whether or not there exists a polynomial time algorithm for testing the structure freeness of a given regular set R. In this paper, we will solve this problem.
This work is supported in part by Grant-in-Aid for Scientific Research on Priority Area No.14085205, Ministry of Education, Culture, Sports, Science and Technology, Japan. It was also supported in part by Grant-in-Aid for Exploratory Research NO.13878054, Japan Society for the Promotion of Science.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Adleman, L.: Molecular Computation of Solutions to Combinatorial Problems. Science 266, 1021–1024 (1994)
Andronescu, M., Dees, D., Slaybaugh, L., Zhao, Y., Condon, A., Cohen, B., Skiena, S.: Algorithms for testing that DNA word designs avoid unwanted secondary structure. In: Proc. of 8th International Meeting on DNA Based Computers, pp. 92–104 (2002)
Brenneman, A., Condon, A.E.: Strand Design for Bio-Molecular Computation. Theoretical Computer Science 287, 39–58 (2002)
Condon, A.E.: Problems on RNA Secondary Structure Prediction and Design. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 22–32. Springer, Heidelberg (2003)
Hofacker, I.L., Fontana, W., Stadler, P.F., Bonhoeffer, L.S., Tacker, M., Schuster, P.: Fast Folding and Comparison of RNA Secondary Structures (The Vienna RNA Package). Monatshefte für Chemie 125, 167–188 (1994)
Johnson, D.S.: Efficient Algorithms for Shortest Paths in Sparse Networks. Journal of the ACM 24, 1–13 (1977)
Kobayashi, S., Yokomori, T., Sakakibara, Y.: An Algorithm for Testing Structure Freeness of Biomolecular Sequences. In: Jonoska, N., Păun, G., Rozenberg, G. (eds.) Aspects of Molecular Computing. LNCS, vol. 2950, pp. 266–277. Springer, Heidelberg (2003)
Sankoff, D., Kruskal, J.B., Mainville, S., Cedergren, R.J.: Fast Algorithms to Determine RNA Secondary Structures Containing Multiple Loops. In: Sankoff, D., Kruskal, J. (eds.) Time Warps, String Edits, and Macromolecules: The Theory and Practice of Sequence Comparison, ch. 3, pp. 93–120 (1983)
Zuker, M., Steigler, P.: Optimal Computer Folding of Large RNA Sequences using Thermodynamics and Auxiliary Information. Nucleic Acids Research 9, 133–148 (1981)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kobayashi, S. (2005). Testing Structure Freeness of Regular Sets of Biomolecular Sequences. In: Ferretti, C., Mauri, G., Zandron, C. (eds) DNA Computing. DNA 2004. Lecture Notes in Computer Science, vol 3384. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11493785_17
Download citation
DOI: https://doi.org/10.1007/11493785_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26174-2
Online ISBN: 978-3-540-31844-6
eBook Packages: Computer ScienceComputer Science (R0)