Probabilistic simple splicing systems

Mathuri Selvarajoo, Fong Wan Heng, Nor Haniza Sarmin, Sherzod Turaev

Research output: Chapter in Book/Report/Conference proceedingConference contribution


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.

Original languageEnglish
Title of host publicationProceedings of the 3rd International Conference on Mathematical Sciences, ICMS 2013
PublisherAmerican Institute of Physics Inc.
Number of pages7
ISBN (Print)9780735412361
Publication statusPublished - 2014
Externally publishedYes
Event3rd International Conference on Mathematical Sciences, ICMS 2013 - Kuala Lumpur, Malaysia
Duration: Dec 17 2013Dec 19 2013

Publication series

NameAIP Conference Proceedings
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616


Conference3rd International Conference on Mathematical Sciences, ICMS 2013
CityKuala Lumpur


  • Computational Power
  • DNA Computing
  • Probability
  • Regular Languages
  • Simple Splicing Systems

ASJC Scopus subject areas

  • General Physics and Astronomy


Dive into the research topics of 'Probabilistic simple splicing systems'. Together they form a unique fingerprint.

Cite this