{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:51:47Z","timestamp":1725562307125},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540207818"},{"type":"electronic","value":"9783540246350"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-24635-0_19","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T11:11:15Z","timestamp":1280747475000},"page":"266-277","source":"Crossref","is-referenced-by-count":2,"title":["An Algorithm for Testing Structure Freeness of Biomolecular Sequences"],"prefix":"10.1007","author":[{"given":"Satoshi","family":"Kobayashi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Yokomori","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasubumi","family":"Sakakibara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_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":"19_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":"19_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"},{"issue":"1","key":"19_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1090\/qam\/102435","volume":"16","author":"R. Bellman","year":"1958","unstructured":"Bellman, R.: On a routing problem. Quarterly of Applied Mathematics\u00a016(1), 87\u201390 (1958)","journal-title":"Quarterly of Applied Mathematics"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Dor, A., Karp, R., Schwikowski, B., Yakhini, Z.: Universal DNA tag systems: A combinatorial design scheme. In: Proc. of the 4th Annual International Conference on Computational Molecular Biology (RECOMB 2000), pp. 65\u201375 (2000)","DOI":"10.1145\/332306.332346"},{"key":"19_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 (Survey paper). Theoretical Computer Science\u00a0287, 39\u201358 (2002)","journal-title":"Theoretical Computer Science"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1103\/PhysRevLett.80.417","volume":"80","author":"R. Deaton","year":"1998","unstructured":"Deaton, R., Garzon, M., Rose, J.A., Franceschetti, D.R., Murphy, R.C., Stevens Jr., S.E.: Reliability and efficiency of a DNA based computation. Physical Review Letter\u00a080, 417\u2013420 (1998)","journal-title":"Physical Review Letter"},{"issue":"23","key":"19_CR8","doi-asserted-by":"publisher","first-page":"4748","DOI":"10.1093\/nar\/25.23.4748","volume":"25","author":"A.G. Frutos","year":"1997","unstructured":"Frutos, A.G., Liu, Q., Thiel, A.J., Sanner, A.M.W., Condon, A.E., Smith, L.M., Corn, R.M.: Demonstration of a word design strategy for DNA computing on surfaces. Nucleic Acids Research\u00a025(23), 4748\u20134757 (1997)","journal-title":"Nucleic Acids Research"},{"key":"19_CR9","volume-title":"Flows in Networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"Ford Jr., L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)"},{"key":"19_CR10","first-page":"89","volume-title":"Proc. of Fifth International Meeting on DNA Based Computers","author":"M. Garzon","year":"1999","unstructured":"Garzon, M., Deaton, R., Rose, J.A., Franceschetti, D.R.: Soft molecular computing. In: Proc. of Fifth International Meeting on DNA Based Computers, June 14-15, pp. 89\u201398. MIT, Cambridge (1999)"},{"key":"19_CR11","first-page":"472","volume-title":"Proc. of 2nd Annual Genetic Programming Conference","author":"M. Garzon","year":"1997","unstructured":"Garzon, M., Neathery, P., Deaton, R., Murphy, R.C., Franceschetti, D.R., Stevens Jr., S.E.: A new metric for DNA computing. In: Proc. of 2nd Annual Genetic Programming Conference, pp. 472\u2013478. Morgan Kaufmann, San Francisco (1997)"},{"key":"19_CR12","series-title":"Natural Computing Series","volume-title":"Modeling in Molecular Biology","author":"M. Hagiya","year":"2003","unstructured":"Hagiya, M.: Towards molecular programming. In: Ciobanu, G. (ed.) Modeling in Molecular Biology. Natural Computing Series, Springer, Heidelberg (2003) (to appear)"},{"key":"19_CR13","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":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/3-540-36440-4_18","volume-title":"DNA Computing","author":"S. Kobayashi","year":"2003","unstructured":"Kobayashi, S., Kondo, T., Arita, M.: On template method for DNA sequence design. In: Hagiya, M., Ohuchi, A. (eds.) DNA 2002. LNCS, vol.\u00a02568, pp. 205\u2013214. Springer, Heidelberg (2003)"},{"key":"19_CR15","unstructured":"Rose, J.A., Deaton, R., Garzon, M., Franceschetti, D.R., Stevens Jr., S.E.: A statistical mechanical treatment of error in the annealing biostep of DNA computation. In: Proc. of GECCO 1999 conference, pp. 1829\u20131834 (1999)"},{"key":"19_CR16","unstructured":"Rose, J.A., Deaton, R.: The fidelity of annealing-ligation: a theoretical analysis. In: Proc. of 6th International Meeting on DNA Based Computers, pp. 207\u2013221 (2000)"},{"key":"19_CR17","unstructured":"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\u2013120 (1983)"},{"key":"19_CR18","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/nar\/9.1.133","volume":"9","author":"M. Zuker","year":"1981","unstructured":"Zuker, M., Steigler, P.: Optimal computer folding of large RNA sequences using thermodynamics and auxiliary information. Nucleic Acids Research\u00a09, 133\u2013148 (1981)","journal-title":"Nucleic Acids Research"}],"container-title":["Lecture Notes in Computer Science","Aspects of Molecular Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24635-0_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T13:05:05Z","timestamp":1552827905000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24635-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540207818","9783540246350"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24635-0_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}