Watson-Crick walks and roads on DOL graphs

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 investig...

Teljes leírás

Elmentve itt :
Bibliográfiai részletek
Szerző: Salomaa Arto
Dokumentumtípus: Cikk
Megjelent: 1999
Sorozat:Acta cybernetica 14 No. 1
Kulcsszavak:Számítástechnika, Kibernetika
Tárgyszavak:
Online Access:http://acta.bibl.u-szeged.hu/12618
LEADER 01538nab a2200217 i 4500
001 acta12618
005 20220614100726.0
008 161015s1999 hu o 0|| eng d
022 |a 0324-721X 
040 |a SZTE Egyetemi Kiadványok Repozitórium  |b hun 
041 |a eng 
100 1 |a Salomaa Arto 
245 1 0 |a Watson-Crick walks and roads on DOL graphs  |h [elektronikus dokumentum] /  |c  Salomaa Arto 
260 |c 1999 
300 |a 179-192 
490 0 |a Acta cybernetica  |v 14 No. 1 
520 3 |a 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. 
650 4 |a Természettudományok 
650 4 |a Számítás- és információtudomány 
695 |a Számítástechnika, Kibernetika 
856 4 0 |u http://acta.bibl.u-szeged.hu/12618/1/cybernetica_014_numb_001_179-192.pdf  |z Dokumentum-elérés