Generative capacity of sticker systems with the presence of weights
DNA computing involves computing models which use the recombination behaviour of DNA molecules as computation devices. This idea was successfully applied by Adleman in his biological experiment in order to show the solvability of the Hamiltonian path problem for larger instances. A DNA-based computa...
Main Authors: | Gan, Y. S., Fong, W. H., Sarmin, N. H., Turaev, S. |
---|---|
Format: | Article |
Language: | English |
Published: |
Science Society of Thailand under Royal Patronage
2021
|
Subjects: | |
Online Access: | http://eprints.utm.my/97851/1/NorHanizaSarmin2021_GenerativeCapacityOfStickerSystemsWithThePresenceOfWeights.pdf |
Similar Items
-
Some properties and variants of weighted sticker systems
by: Gan, Yee Siang, et al.
Published: (2013) -
Probabilistic sticker systems
by: Selvarajoo, Mathuri, et al.
Published: (2013) -
Computational power of probabilistic bidirectional sticker system in dna computing
by: Selvarajoo, Mathuri, et al.
Published: (2015) -
The generative power of weighted one-sided and regular sticker systems
by: Gan, Yee Siang, et al.
Published: (2014) -
Sticker systems over monoids
by: Mohd. Sebry, N. A., et al.
Published: (2012)