{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:58:37Z","timestamp":1725544717192},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540341611"},{"type":"electronic","value":"9783540341659"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753681_13","type":"book-chapter","created":{"date-parts":[[2006,7,28]],"date-time":"2006-07-28T02:31:54Z","timestamp":1154053914000},"page":"171-180","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences"],"prefix":"10.1007","author":[{"given":"Atsushi","family":"Kijima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satoshi","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L. Adleman","year":"1994","unstructured":"Adleman, L.: Molecular Computation of Solutions to Combinatorial Problems. Science\u00a0266, 1021\u20131024 (1994)","journal-title":"Science"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/3-540-36440-4_16","volume-title":"DNA Computing","author":"M. Andronescu","year":"2003","unstructured":"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.\u00a02568, pp. 182\u2013195. Springer, Heidelberg (2003)"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF03037360","volume":"20","author":"M. Arita","year":"2002","unstructured":"Arita, M., Kobayashi, S.: DNA sequence design using templates. New Generation Computing\u00a020, 263\u2013277 (2002)","journal-title":"New Generation Computing"},{"key":"13_CR4","unstructured":"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\u2013882 (2000)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1038\/nature02551","volume":"429","author":"Y. Benenson","year":"2004","unstructured":"Benenson, Y., Gil, B., Ben-Dor, U., Adar, R., Shapiro, E.: An autonomous molecular computer for logical control of gene expression. Nature\u00a0429, 423\u2013429 (2004)","journal-title":"Nature"},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0304-3975(02)00135-4","volume":"287","author":"A. Brenneman","year":"2002","unstructured":"Brenneman, A., Condon, A.E.: Strand Design for Bio-Molecular Computation. Theoretical Computer Science\u00a0287, 39\u201358 (2002)","journal-title":"Theoretical Computer Science"},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"12577","DOI":"10.1073\/pnas.202418299","volume":"99","author":"A. Carbone","year":"2002","unstructured":"Carbone, A., Seeman, N.C.: Circuits and programmable self-assembling DNA structures. Proc. Natl. Acad. Sci. USA\u00a099, 12577\u201312582 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/3-540-45061-0_2","volume-title":"Automata, Languages and Programming","author":"A.E. Condon","year":"2003","unstructured":"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.\u00a02719, pp. 22\u201332. Springer, Heidelberg (2003)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1002\/jcc.20057","volume":"25","author":"R.M. Dirks","year":"2004","unstructured":"Dirks, R.M., Pierce, N.A.: An algorithm for computing nucleic acid base-pairing probabilities including pseudoknots. Journal of Computational Chemistry\u00a025, 1295\u20131304 (2004)","journal-title":"Journal of Computational Chemistry"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","first-page":"142","volume-title":"DNA Computing","author":"A.G. D\u2019yachkov","year":"2005","unstructured":"D\u2019yachkov, 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.\u00a03384, pp. 142\u2013151. Springer, Heidelberg (2005)"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BF00818163","volume":"125","author":"I.L. Hofacker","year":"1994","unstructured":"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\u00fcr Chemie\u00a0125, 167\u2013188 (1994)","journal-title":"Monatshefte f\u00fcr Chemie"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","first-page":"16","volume-title":"DNA Computing","author":"L. Kari","year":"2005","unstructured":"Kari, L., Konstantinidis, S., Sos\u00edk, P.: Bond-free languages: Formalizations, maximality and construction methods. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol.\u00a03384, pp. 16\u201325. Springer, Heidelberg (2005)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/11493785_17","volume-title":"DNA Computing","author":"S. Kobayashi","year":"2005","unstructured":"Kobayashi, S.: Testing structure freeness of regular sets of biomolecular sequence. In: Ferretti, C., Mauri, G., Zandron, C. (eds.) DNA 2004. LNCS, vol.\u00a03384, pp. 395\u2013404. Springer, Heidelberg (2005)"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1007\/b99817","volume-title":"Aspects of Molecular Computing \u2014 Essays dedicated to Tom Head on the occasion of his 70th birthday","author":"S. Kobayashi","year":"2004","unstructured":"Kobayashi, S., Yokomori, T., Sakakibara, Y.: An Algorithm for Testing Structure Freeness of Biomolecular Sequences. In: Aspects of Molecular Computing. LNCS, vol.\u00a02950, pp. 266\u2013277. Springer, Heidelberg (2004)"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1038\/35035038","volume":"407","author":"C. Mao","year":"2000","unstructured":"Mao, C., LaBean, T.H., Reif, J.H., Seeman, N.C.: Logical computation using algorithmic self-assembly of DNA triple-crossover molecules. Nature\u00a0407, 493\u2013496 (2000)","journal-title":"Nature"},{"key":"13_CR16","doi-asserted-by":"publisher","first-page":"1105","DOI":"10.1002\/bip.360290621","volume":"29","author":"J.S. McCaskill","year":"1990","unstructured":"McCaskill, J.S.: The equilibrium partition function and base pair binding probabilities for RNA secondary structure. Biopolymers\u00a029, 1105\u20131119 (1990)","journal-title":"Biopolymers"},{"key":"13_CR17","unstructured":"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\u2013120 (1983)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-36440-4_20","volume-title":"DNA Computing","author":"D.C. Tulpan","year":"2003","unstructured":"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.\u00a02568, pp. 229\u2013241. Springer, Heidelberg (2003)"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1038\/28998","volume":"394","author":"E. Winfree","year":"1998","unstructured":"Winfree, E., Liu, F., Wenzler, L.A., Seeman, N.C.: Design self-assembly of two-dimensional DNA crystals. Nature\u00a0394, 539\u2013544 (1998)","journal-title":"Nature"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1126\/science.2468181","volume":"244","author":"M. Zuker","year":"1989","unstructured":"Zuker, M.: On finding all suboptimal foldings of an RNA molecule. Science\u00a0244, 48\u201352 (1989)","journal-title":"Science"}],"container-title":["Lecture Notes in Computer Science","DNA Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753681_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,12]],"date-time":"2019-03-12T03:22:19Z","timestamp":1552360939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753681_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341611","9783540341659"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11753681_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}