Watson-Crick walks and roads on DOL graphs
Acta Cybernetica
Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages
Journal of the ACM (JACM)
Language-theoretic aspects of DNA complementarity
Theoretical Computer Science
Mathematical Theory of L Systems
Mathematical Theory of L Systems
A Survey of Russian Approaches to Perebor (Brute-Force Searches) Algorithms
IEEE Annals of the History of Computing
DNA Complementarity and Paradigms of Computing
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
DNA computing for complex scheduling problem
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part II
| Hi-index | 0.02 |
DNA computing is one of the most exciting new developments in computer science, from both technological and theoretical point of view. We begin by observing how the structure of DNA molecules and the technics available for manipulating them are very suitable for computing. We then establish a link with certain fairly old results from computability theory which essentially explain why the main feature of DNA molecules, the Watson-Crick complementarity, gives rise to the Turing-universality of DNA computations. Selected areas of DNA computing, interesting from a theoretical point of view but offering also practical potential, will be briefly examined.