{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T20:30:07Z","timestamp":1777667407108,"version":"3.51.4"},"reference-count":69,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3972,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0304-3975(02)00134-2","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T20:38:10Z","timestamp":1034368690000},"page":"3-38","source":"Crossref","is-referenced-by-count":54,"title":["Topics in the theory of DNA computing"],"prefix":"10.1016","volume":"287","author":[{"given":"Martyn","family":"Amos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gheorghe","family":"P\u0103un","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grzegorz","family":"Rozenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arto","family":"Salomaa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(02)00134-2_BIB1","series-title":"The Biochemistry of the Nucleic Acids","author":"Adams","year":"1986"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB2","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1126\/science.7973651","article-title":"Molecular computation of solutions to combinatorial problems","volume":"226","author":"Adleman","year":"1994","journal-title":"Science"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB3","unstructured":"L.M. Adleman, P.W.K. Rothemund, S. Roweiss, E. Winfree, On applying molecular computations to the data encryption standard, in: E. Baum, D. Boneh, P. Kaplan, R. Lipton, J. Reif, N. Seeman (Eds.), DNA Based Computers, Proc. 2nd Annual Meeting, Princeton, 1996, pp. 28\u201348."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB4","unstructured":"M. Amos, DNA computation, Ph.D. thesis, Department of Computer Science, University of Warwick, UK, September 1997."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB5","unstructured":"M. Amos, P.E. Dunne, DNA simulation of Boolean circuits, Technical Report CTAG-97009, Department of Computer Science, University of Liverpool, December 1997."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB6","series-title":"Genetic Programming, Proc. 3rd Annual Conference","first-page":"679","article-title":"DNA simulation of Boolean circuits","author":"Amos","year":"1998"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB7","series-title":"Proc. 1st International Conference on Bio-Computing and Emergent Computation, University of Sk\u00f6vde, Sweden","first-page":"165","article-title":"The complexity and viability of DNA computations","author":"Amos","year":"1997"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB8","series-title":"Unconventional Models of Computation","first-page":"1","article-title":"Practical implementation of DNA computations","author":"Amos","year":"1998"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB9","doi-asserted-by":"crossref","unstructured":"K.E. Batcher, Sorting networks and their applications, Proc. American Federation of Information Processing Societies 1968 Spring Joint Computer Conference, Vol. 32, Thompson Book Co, Washington, DC, 1968, pp. 307\u2013314.","DOI":"10.1145\/1468075.1468121"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB10","doi-asserted-by":"crossref","unstructured":"K.J. Breslauer, R. Frank, H. Blocker, L.A. Marky, Predicting DNA duplex stability from the base sequence, Proc. Natl. Acad. Sci. (1986) 3746\u20133750.","DOI":"10.1073\/pnas.83.11.3746"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB11","series-title":"Genetics","author":"Brown","year":"1993"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB12","series-title":"Computing with Cells and Atoms","author":"Calude","year":"2000"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB13","unstructured":"A. Condon, G. Rozenberg (Eds.), DNA Computing, Proc. 6th Internat. Workshop on DNA-Based Computers, DNA 2000, Leiden, The Netherlands, Lecture Notes in Computer Science, Vol. 2054, Springer, Berlin, 2000."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB14","series-title":"Grammar Systems. A Grammatical Approach to Distribution and Cooperation","author":"Csuhaj-Varju","year":"1994"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB15","series-title":"Proc. 1st Annu. Pacific Symp. on Biocomputing, Hawaii, January 1996","first-page":"179","article-title":"DNA computing based on splicing: universality results","author":"Csuhaj-Varju","year":"1996"},{"issue":"2\u20133","key":"10.1016\/S0304-3975(02)00134-2_BIB16","first-page":"211","article-title":"Test tube distributed systems based on splicing","volume":"15","author":"Csuhaj-Varju","year":"1996","journal-title":"Comput. Artif. Intell."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB17","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0166-218X(91)90054-Z","article-title":"Splicing semigroups of dominoes and DNA","volume":"31","author":"Culik II","year":"1991","journal-title":"Discrete Appl. Math."},{"issue":"2\u20133","key":"10.1016\/S0304-3975(02)00134-2_BIB18","first-page":"109","article-title":"Splicing grammar systems","volume":"15","author":"Dassow","year":"1996","journal-title":"Comput. Artif. Intell."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB19","series-title":"Regulated Rewriting in Formal Language Theory","author":"Dassow","year":"1989"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB20","series-title":"Understanding DNA and Gene Cloning. A Guide for the CURIOUS","author":"Drlica","year":"1992"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB21","series-title":"The Complexity of Boolean Networks","author":"Dunne","year":"1988"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB22","doi-asserted-by":"crossref","unstructured":"A. Ehrenfeucht, H.J. Hoogeboom, G. Rozenberg, N. van Vugt, Forbidding and enforcing, in: E. Winfree, D.K. Gifford (Eds.), DNA Based Computers V, DIMACS Series in Discrete Mathematics, Vol. 54 (1999 proceedings), Massachusetts Institute of Technology, USA, 2000.","DOI":"10.1090\/dimacs\/054\/16"},{"issue":"2","key":"10.1016\/S0304-3975(02)00134-2_BIB23","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s005000000072","article-title":"Sequences of languages in forbidding\u2013enforcing families","volume":"5","author":"Ehrenfeucht","year":"2001","journal-title":"Soft Comput."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB24","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322203.322211","article-title":"Fixed-point languages, equality languages, and representations of recursively enumerable languages","volume":"27","author":"Engelfriet","year":"1980","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB25","doi-asserted-by":"crossref","unstructured":"A. Ehrenfeucht, G. Rozenberg, Forbidding-enforcing systems, Theoret. Comput. Sci., to appear.","DOI":"10.1016\/S0304-3975(01)00088-3"},{"issue":"2","key":"10.1016\/S0304-3975(02)00134-2_BIB26","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/S0304-3975(99)00098-5","article-title":"Nine test tubes generate any RE language","volume":"231","author":"Ferretti","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB27","doi-asserted-by":"crossref","unstructured":"A. Gehani, T.H. LaBean, J.H. Reif, DNA-based cryptography, manuscript, 2000.","DOI":"10.1090\/dimacs\/054\/19"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB28","series-title":"Introduction to Switching and Automata Theory","author":"Harrison","year":"1965"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB29","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1007\/BF02481771","article-title":"Formal language theory and DNA","volume":"49","author":"Head","year":"1987","journal-title":"Bull. Math. Biol."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB30","unstructured":"L. Kari, H. Rubin, D.H. Wood (Eds.), Proc. 4th Internat. Meeting on DNA-Based Computers, Pennsylvania University, June 1998, BioSystems 52 (1999)."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB31","unstructured":"M. Margenstern, Y. Rogozhin, A universal time-varying distributed H systems of degree 2, Proc. 4th Internat. Meeting on DNA Based Computers, Philadelphia, June 1998."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB32","series-title":"Where Mathematics, Computer Science, Linguistics, and Biology Meet","first-page":"399","article-title":"Time-varying distributed H-systems of degree 2 generate all RE languages","author":"Margenstern","year":"2001"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB33","series-title":"Words, Semigroups, and Transductions","first-page":"329","article-title":"Time-varying distributed H systems of degree 1 generate all recursively enumerable languages","author":"Margenstern","year":"2001"},{"issue":"1","key":"10.1016\/S0304-3975(02)00134-2_BIB34","first-page":"3","article-title":"Cooperating distributed splicing systems","volume":"4","author":"Martin-Vide","year":"1999","journal-title":"J. Automata, Languages, Combin."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB35","series-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB36","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1038\/scientificamerican0490-56","article-title":"The unusual origin of the polymerase chain reaction","volume":"262","author":"Mullis","year":"1990","journal-title":"Scientific American"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB37","doi-asserted-by":"crossref","unstructured":"K.B. Mullis, F. Ferr\u00e9, R.A. Gibbs (Eds.), The Polymerase Chain Reaction, Birkhauser, Basel, 1994.","DOI":"10.1007\/978-1-4612-0257-8"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB38","doi-asserted-by":"crossref","unstructured":"M. Ogihara, A. Ray, Simulating Boolean circuits on a DNA computer, Technical Report 631, University of Rochester, August 1996.","DOI":"10.1145\/267521.267759"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB39","series-title":"Principles of Gene Manipulation: An Introduction to Genetic Engineering","author":"Old","year":"1994"},{"issue":"1","key":"10.1016\/S0304-3975(02)00134-2_BIB40","first-page":"27","article-title":"Regular extended H systems are computationally universal","volume":"1","author":"P\u0103un","year":"1996","journal-title":"J. Automata, Languages, Combin."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB41","first-page":"353","article-title":"DNA computing, distributed splicing systems","volume":"Vol. 1261","author":"P\u0103un","year":"1997"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB42","unstructured":"Gh. P\u0103un, Two-level distributed H systems, in: S. Bozapalidis (Ed.), Proc. Developments in Language Theory Conf., Vol. III,Aristotle University of Thessaloniki, Thessaloniki, 1997, pp. 309\u2013327."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB43","series-title":"Unconventional Models of Computation","first-page":"323","article-title":"Distributed architectures in DNA computing based on splicing","author":"P\u0103un","year":"1998"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB44","first-page":"157","article-title":"On time-varying H systems","volume":"67","author":"P\u0103un","year":"1999","journal-title":"Bull. EATCS"},{"issue":"2","key":"10.1016\/S0304-3975(02)00134-2_BIB45","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0304-3975(99)00104-8","article-title":"DNA computing based on splicing: universality results","volume":"231","author":"P\u0103un","year":"2000","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/S0304-3975(02)00134-2_BIB46","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1006\/jcss.1999.1693","article-title":"Computing with membranes","volume":"61","author":"P\u0103un","year":"2000","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB47","doi-asserted-by":"crossref","unstructured":"Gh. P\u0103un, G. Rozenberg, A guide to membrane computing, Theoret. Comput. Sci., this volume.","DOI":"10.1016\/S0304-3975(02)00136-6"},{"issue":"2","key":"10.1016\/S0304-3975(02)00134-2_BIB48","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0304-3975(96)00082-5","article-title":"Computing by splicing","volume":"168","author":"P\u0103un","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB49","series-title":"DNA Computing","author":"P\u0103un","year":"1998"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB50","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0166-218X(95)00079-7","article-title":"Regularity of splicing languages","volume":"69","author":"Pixton","year":"1996","journal-title":"Discrete Appl. Math."},{"issue":"1\u20132","key":"10.1016\/S0304-3975(02)00134-2_BIB51","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(98)00046-2","article-title":"Splicing in abstract families of languages","volume":"234","author":"Pixton","year":"2000","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB52","series-title":"Pacific Symp. on Biocomputing","first-page":"547","article-title":"Finite H systems with 3 tubes are not predictable","author":"Priese","year":"1998"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB53","unstructured":"J.M. Robertson (Ed.), The Philosophical Works of Francis Bacon, George Rutledge and Sons, London, 1905."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB54","unstructured":"S. Roweis, E. Winfree, R. Burgoyne, N. Chelyapov, M. Goodman, P. Rothemund, L. Adleman, A sticker based architecture for DNA computation, Proc. 2nd Annual Meeting on DNA Based Computers, DIMACS: Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI, June 1996."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB55","series-title":"The Mathematical Theory of L Systems","author":"Rozenberg","year":"1980"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB56","unstructured":"G. Rozenberg, A. Salomaa, Watson\u2013Crick complementarity universal computations and genetic engineering, Computer Science Technical Report 28, Leiden University, 1996."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB57","unstructured":"G. Rozenberg, A. Salomaa, DNA Computing: New Ideas and Paradigms, Lecture Notes Computer Science, Vol. 1644, Springer, Berlin, 1999, pp. 106\u2013118."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB58","series-title":"Jewels of Formal Language Theory","author":"Salomaa","year":"1981"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB59","series-title":"Public-Key Cryptography","author":"Salomaa","year":"1996"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB60","series-title":"Unconventional Models of Computation","first-page":"94","article-title":"Turing, Watson\u2013Crick and Lindenmayer. Aspects of DNA complementarity","author":"Salomaa","year":"1998"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB61","series-title":"Molecular Cloning: A Laboratory Manual","author":"Sambrook","year":"1989"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB62","series-title":"Applied Cryptography","author":"Schneier","year":"1996"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB63","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1090\/S0002-9947-1913-1500960-1","article-title":"A set of five independent postulates for Boolean algebras, with application to logical constants","volume":"14","author":"Sheffer","year":"1913","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB64","unstructured":"N. van Vugt, Models of molecular computing, Ph.D. Thesis, Leiden Institute of Advanced Computer Science, Leiden University, 2002."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB65","unstructured":"J.D. Watson, M. Gilman, J. Witkowski, M. Zoller, Recombinant DNA, 2nd ed., Scientific American Books, 1992."},{"key":"10.1016\/S0304-3975(02)00134-2_BIB66","doi-asserted-by":"crossref","unstructured":"I. Wegener, The Complexity of Boolean Functions, Wiley\/Teubner, New York\/Stuttgart, 1987.","DOI":"10.1007\/3-540-18170-9_185"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB67","series-title":"Principles of CMOS VLSI Design","author":"Weste","year":"1993"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB68","series-title":"Genetic Engineering","author":"Williams","year":"1993"},{"key":"10.1016\/S0304-3975(02)00134-2_BIB69","first-page":"319","article-title":"A reduced distributed splicing system for RE languages","volume":"Vol. 1218","author":"Zandron","year":"1997"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502001342?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502001342?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T02:25:35Z","timestamp":1580869535000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502001342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":69,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0304397502001342"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00134-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}