Abstract
In this paper we will focus on the structure freeness test problem of finite sets of sequences. The result is an extension of Andronescu’s algorithm which can be applied to the sequence design of various DNA computing experiments. We will first give a general algorithm for this problem which runs in O(n 5) time. Then, we will give an evaluation method for sequence design system, which requires O(n 5) time for precomputation, and O(n 4) time and O(n 5) space for each evaluation of sequence sets. The authors believe that this result will give an important progress of efficient sequence design systems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
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 Sets of DNA Words Concatenate without Secondary Structure. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 182–195. Springer, Heidelberg (2003)
Arita, M., Kobayashi, S.: DNA sequence design using templates. New Generation Computing 20, 263–277 (2002)
Arita, M., Nishikawa, A., Hagiya, M., Komiya, K., Gouzu, H., Sakamoto, K.: Improving sequence design for DNA computing. In: Proc. of Genetic and Evolutionary Computation Conference 2000, pp. 875–882 (2000)
Benenson, Y., Gil, B., Ben-Dor, U., Adar, R., Shapiro, E.: An autonomous molecular computer for logical control of gene expression. Nature 429, 423–429 (2004)
Brenneman, A., Condon, A.E.: Strand Design for Bio-Molecular Computation. Theoretical Computer Science 287, 39–58 (2002)
Carbone, A., Seeman, N.C.: Circuits and programmable self-assembling DNA structures. Proc. Natl. Acad. Sci. USA 99, 12577–12582 (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)
Dirks, R.M., Pierce, N.A.: An algorithm for computing nucleic acid base-pairing probabilities including pseudoknots. Journal of Computational Chemistry 25, 1295–1304 (2004)
D’yachkov, A.G., Macula, A.J., Pogozelski, W.K., Renz, T.E., Rykov, V.V., Torney, D.C.: A weighted insertion-deletion stacked pair thermodynamic metric for DNA codes. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 142–151. Springer, Heidelberg (2005)
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)
Kari, L., Konstantinidis, S., Sosík, P.: Bond-free languages: Formalizations, maximality and construction methods. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 16–25. Springer, Heidelberg (2005)
Kobayashi, S.: Testing structure freeness of regular sets of biomolecular sequence. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol. 3384, pp. 395–404. Springer, Heidelberg (2005)
Kobayashi, S., Yokomori, T., Sakakibara, Y.: An Algorithm for Testing Structure Freeness of Biomolecular Sequences. In: Aspects of Molecular Computing. LNCS, vol. 2950, pp. 266–277. Springer, Heidelberg (2004)
Mao, C., LaBean, T.H., Reif, J.H., Seeman, N.C.: Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature 407, 493–496 (2000)
McCaskill, J.S.: The equilibrium partition function and base pair binding probabilities for RNA secondary structure. Biopolymers 29, 1105–1119 (1990)
Sankoff, D., Kruskal, J.B., Mainville, S., Cedergen, 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)
Tulpan, D.C., Hoos, H.H., Condon, A.E.: Stochastic local search algorithms for DNA word design. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol. 2568, pp. 229–241. Springer, Heidelberg (2003)
Winfree, E., Liu, F., Wenzler, L.A., Seeman, N.C.: Design self-assembly of two-dimensional DNA crystals. Nature 394, 539–544 (1998)
Zuker, M.: On finding all suboptimal foldings of an RNA molecule. Science 244, 48–52 (1989)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kijima, A., Kobayashi, S. (2006). Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences. In: Carbone, A., Pierce, N.A. (eds) DNA Computing. DNA 2005. Lecture Notes in Computer Science, vol 3892. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11753681_13
Download citation
DOI: https://doi.org/10.1007/11753681_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34161-1
Online ISBN: 978-3-540-34165-9
eBook Packages: Computer ScienceComputer Science (R0)