Topics in the theory of DNA computing

Theoretical Computer Science

Volumn 287, Issue 1, 2002, Pages 3-38

  Amos, Martyn ^a   Pun, Gheorghe ^b,c   Rozenberg, Grzegorz ^d,e   Salomaa, Arto ^f  

^a UNIVERSITY OF LIVERPOOL   (United Kingdom)

^b INSTITUTE OF MATHEMATICS   (Romania)

^c UNIVERSITAT ROVIRA I VIRGILI   (Spain)

^d LEIDEN UNIVERSITY   (Netherlands)

^e UCB 450   (United States)

^f TURKU CENTRE FOR COMPUTER SCIENCE   (Finland)

Author keywords

Biomolecular tool box; Boolean circuits; Cryptography; DNA computing; DNA molecules; Molecular computing; Recursively enumerable languages; Splicing systems; Turing universality

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTER SCIENCE; CRYPTOGRAPHY; DNA; FORMAL LANGUAGES; MOLECULAR BIOLOGY; PARALLEL PROCESSING SYSTEMS;

MOLECULAR COMPUTING;

COMPUTATION THEORY;

EID: 0037174197     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(02)00134-2     Document Type: Article

References (69)

1. Molecular computation of solutions to combinatorial problems
2. On applying molecular computations to the data encryption standard
3. DNA simulation of Boolean circuits
4. The complexity and viability of DNA computations
5. Practical implementation of DNA computations
6. Sorting networks and their applications
7. Predicting DNA duplex stability from the base sequence
8. DNA computing, Proc. 6th Internat. Workshop on DNA-based computers, DNA 2000
9. Grammar systems
10. DNA computing based on splicing: Universality results
11. Test tube distributed systems based on splicing
12. Splicing semigroups of dominoes and DNA
13. Splicing grammar systems
14. Understanding DNA and gene cloning
15. Forbidding and enforcing
16. Sequences of languages in forbidding-enforcing families
17. Fixed-point languages, equality languages, and representations of recursively enumerable languages
18. Forbidding-enforcing systems
19. Nine test tubes generate any RE language
20. Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
21. Proc. 4th Internat. Meeting on DNA-based computers
22. A universal time-varying distributed H systems of degree 2
23. Time-varying distributed H-systems of degree 2 generate all RE languages
24. Time-varying distributed H systems of degree 1 generate all recursively enumerable languages
25. Cooperating distributed splicing systems
26. The unusual origin of the polymerase chain reaction
27. Regular extended H systems are computationally universal
28. DNA computing, distributed splicing systems
29. Two-level distributed H systems
30. Distributed architectures in DNA computing based on splicing: Limiting the size of components
31. On time-varying H systems
32. DNA computing based on splicing: Universality results
33. Computing with membranes
34. A guide to membrane computing
35. Computing by splicing
36. Regularity of splicing languages
37. Splicing in abstract families of languages
38. Finite H systems with 3 tubes are not predictable
39. A sticker based architecture for DNA computation
40. Watson-Crick complementarity universal computations and genetic engineering
41. DNA computing: New ideas and paradigms
42. Turing, Watson-Crick and Lindenmayer. Aspects of DNA complementarity
43. A set of five independent postulates for Boolean algebras, with application to logical constants
44. A reduced distributed splicing system for RE languages