Salomaa Arto: Watson-Crick walks and roads on DOL graphs. In: Acta cybernetica, (14) 1. pp. 179-192. (1999)
Preview |
Cikk, tanulmány, mű
cybernetica_014_numb_001_179-192.pdf Download (933kB) | Preview |
Abstract
Apart from the massive parallelism of DNA strands, the phenomenon known as Watson-Crick complementarity, is basic both in the experiments and theory of DNA computing. The parallelism makes exhaustive searches possible, whereas the complementarity is a powerful computational tool. This paper investigates complementarity as a language-theoretic operation: "bad" words obtained through a generative process are replaced by their complementary ones. While this idea is applicable to any generative process, it seems particularly suitable for Lindenmayer systems. DOL systems augmented with a specific complementarity transition, "Watson-Crick DOL systems", are investigated in this paper. Many issues involved are conveniently expressed in terms of certain paths, "Watson- Crick walks", in an associated digraph.
Item Type: | Article |
---|---|
Journal or Publication Title: | Acta cybernetica |
Date: | 1999 |
Volume: | 14 |
Number: | 1 |
ISSN: | 0324-721X |
Page Range: | pp. 179-192 |
Language: | English |
Place of Publication: | Szeged |
Related URLs: | http://acta.bibl.u-szeged.hu/38507/ |
Uncontrolled Keywords: | Számítástechnika, Kibernetika |
Additional Information: | Bibliogr.: p. 191-192. ; összefoglalás angol nyelven |
Subjects: | 01. Natural sciences 01. Natural sciences > 01.02. Computer and information sciences |
Date Deposited: | 2016. Oct. 15. 12:26 |
Last Modified: | 2022. Jun. 14. 10:07 |
URI: | http://acta.bibl.u-szeged.hu/id/eprint/12618 |
Actions (login required)
![]() |
View Item |