Selvarajoo, Mathuri and Fong, Wan Heng and Sarmin, Nor Haniza and Turaev, Sherzod
(2013)
*Probabilistic sticker systems.*
Malaysian Journal of Fundamental and Applied Sciences (MJFAS), 9
(3).
pp. 150-155.
ISSN 0306-2619

Full text not available from this repository.

## Abstract

A model for DNA computing using the recombination behaviour of DNA molecules known as a sticker system has been introduced by Adleman in 1994. A sticker model is an abstract computational model which uses the Watson-Crick complementary principle of DNA molecules. Starting from the axioms – incomplete double stranded sequences, and iteratively using sticking operations, complete double stranded sequences are obtained. It is known that sticker systems with finite sets of axioms and sticker rules generate only regular languages. Hence, different types of restrictions have been considered to increase the computational power of sticker systems. In this paper, we introduce probabilistic sticker systems in which probabilities are initially associated with the axioms, and the probability of the generated string is computed by multiplying the probabilities of all occurrences of the initial strings used in the computation of the string.

Item Type: | Article |
---|---|

Uncontrolled Keywords: | , dna computing , sticker system ,probabilistic , regular languages , computationalpower |

Subjects: | Q Science |

Divisions: | Chancellery |

ID Code: | 41023 |

Deposited By: | Liza Porijo |

Deposited On: | 20 Aug 2014 16:19 |

Last Modified: | 15 Feb 2017 14:50 |

Repository Staff Only: item control page