Some properties and variants of weighted sticker systems
Sticker system has been introduced by Kari in 1998 as a model for DNA computing using the recombination behavior of DNA molecules. A sticker model is an abstract computational model which uses the Watson-Crick complementary principle of DNA molecules. A sticker operation works by using ligation and...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
CESER Publications
2013
|
| Subjects: | |
| Online Access: | http://irep.iium.edu.my/32270/ http://irep.iium.edu.my/32270/ http://irep.iium.edu.my/32270/1/51374-IJAMAS_Gan_2013_pg._367-375._2137-2244-1-PB.pdf |
| Summary: | Sticker system has been introduced by Kari in 1998 as a model for DNA computing using the recombination behavior of DNA molecules. A sticker model is an abstract computational model which uses the Watson-Crick complementary principle of DNA molecules. A sticker operation works by using ligation and annealing operation to form a complete double stranded DNA sequence. In this paper, a new variant of sticker systems, called weighted sticker systems, is introduced. Some basic properties of language families that are generated by the weighted sticker systems are investigated. This paper also introduces some restricted weighted variants of sticker systems such as weighted one-sided, regular, simple, simple one-sided and simple regular sticker systems. Moreover, the paper shows that the presence of weights increases the generative powers of usual variants of sticker systems. |
|---|