Selvarajoo, Mathuri and Fong, Wan Heng and Sarmin, Nor Haniza and Sherzod, Turaev
(2014)
*Probabilistic simple splicing systems.*
Proceedings of the 3rd International Conference on Mathematical Sciences, 1602
.
pp. 760-766.
ISSN 0094-243X

Full text not available from this repository.

Official URL: http://dx.doi.org/10.1063/1.4882571

## Abstract

A splicing system, one of the early theoretical models for DNA computing was introduced by Head in 1987. Splicing systems are based on the splicing operation which, informally, cuts two strings of DNA molecules at the specific recognition sites and attaches the prefix of the first string to the suffix of the second string, and the prefix of the second string to the suffix of the first string, thus yielding the new strings. For a specific type of splicing systems, namely the simple splicing systems, the recognition sites are the same for both strings of DNA molecules. It is known that splicing systems with finite sets of axioms and splicing rules only generate regular languages. Hence, different types of restrictions have been considered for splicing systems in order to increase their computational power. Recently, probabilistic splicing systems have been introduced where the probabilities are initially associated with the axioms, and the probabilities of the generated strings are computed from the probabilities of the initial strings. In this paper, some properties of probabilistic simple splicing systems are investigated. We prove that probabilistic simple splicing systems can also increase the computational power of the splicing languages generated.

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

Uncontrolled Keywords: | computational power, DNA computing |

Subjects: | Q Science |

Divisions: | Science |

ID Code: | 62337 |

Deposited By: | Widya Wahid |

Deposited On: | 05 Jun 2017 15:12 |

Last Modified: | 05 Jun 2017 15:12 |

Repository Staff Only: item control page