Probabilistic Splicing Systems

Turaev, Sherzod; Selvarajoo, Mathuri; Selamat, Mohd Hasan; Sarmin, Nor Haniza; Fong, Wan Heng

doi:10.1007/978-3-642-34300-1_25

Cited by 2 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It has been proven that the languages generated by probabilistic splicing system have a higher computational power as compared to the languages generated by splicing systems without any restriction on the rules as stated by Turaev et al [5]. The same result is obtained when probability is used as a restriction in sticker operation by Selvarajoo et al [6].…”

Section: Introductionmentioning

confidence: 61%

“…The reader is referred to Turaev et al, Linz and Mateescu et al [5,7,8] for more detailed information.…”

Section: Preliminariesmentioning

confidence: 97%

“…In probabilistic splicing systems, probabilities are associated with the axioms (not with the rules), and the probability of the generated string from two strings is calculated by multiplication of their probabilities as shown by Turaev et al and Selvarajoo et al [5,6]. In this paper, we consider a probabilistic variant of simple splicing systems.…”

Section: Introductionmentioning

confidence: 98%

“…Definition 3(Turaev et al[5])A Probabilistic Splicing Operation is defined as below: For strings * ( , ( )), ( , ( )), ( , ( )) [0,1], language generated by a probabilistic splicing system , , , , . V T A R p We consider as thresholds (cut-points) sub-segments and discrete subsets of [0, 1] as well as real numbers in [0, 1].…”

mentioning

confidence: 99%

See 3 more Smart Citations

Probabilistic simple splicing systems

Selvarajoo¹,

Fong²,

Sarmin³

et al. 2014

AIP Conference Proceedings

Self Cite

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 61%

“…The reader is referred to Turaev et al, Linz and Mateescu et al [5,7,8] for more detailed information.…”

Section: Preliminariesmentioning

confidence: 97%

Section: Introductionmentioning

confidence: 98%

mentioning

confidence: 99%

See 2 more Smart Citations