Weighted Watson-Crick automata

Mohd Izzuddin Mohd Tamrin, Sherzod Turaev, Tengku Mohd Tengku Sembok

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

4 Citations (Scopus)

Abstract

There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power.

Original languageEnglish
Title of host publicationAIP Conference Proceedings
PublisherAmerican Institute of Physics Inc.
Pages302-306
Number of pages5
Volume1605
ISBN (Print)9780735412415
DOIs
Publication statusPublished - 2014
Externally publishedYes
Event21st National Symposium on Mathematical Sciences: Germination of Mathematical Sciences Education and Research Towards Global Sustainability, SKSM 21 - Penang
Duration: 6 Nov 20138 Nov 2013

Other

Other21st National Symposium on Mathematical Sciences: Germination of Mathematical Sciences Education and Research Towards Global Sustainability, SKSM 21
CityPenang
Period6/11/138/11/13

Fingerprint

deoxyribonucleic acid
stochastic processes
grammars
biotechnology
nucleotides
food
genes
molecules
constrictions

ASJC Scopus subject areas

  • Physics and Astronomy(all)

Cite this

Tamrin, M. I. M., Turaev, S., & Sembok, T. M. T. (2014). Weighted Watson-Crick automata. In AIP Conference Proceedings (Vol. 1605, pp. 302-306). American Institute of Physics Inc.. https://doi.org/10.1063/1.4887606

Weighted Watson-Crick automata. / Tamrin, Mohd Izzuddin Mohd; Turaev, Sherzod; Sembok, Tengku Mohd Tengku.

AIP Conference Proceedings. Vol. 1605 American Institute of Physics Inc., 2014. p. 302-306.

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

Tamrin, MIM, Turaev, S & Sembok, TMT 2014, Weighted Watson-Crick automata. in AIP Conference Proceedings. vol. 1605, American Institute of Physics Inc., pp. 302-306, 21st National Symposium on Mathematical Sciences: Germination of Mathematical Sciences Education and Research Towards Global Sustainability, SKSM 21, Penang, 6/11/13. https://doi.org/10.1063/1.4887606
Tamrin MIM, Turaev S, Sembok TMT. Weighted Watson-Crick automata. In AIP Conference Proceedings. Vol. 1605. American Institute of Physics Inc. 2014. p. 302-306 https://doi.org/10.1063/1.4887606
Tamrin, Mohd Izzuddin Mohd ; Turaev, Sherzod ; Sembok, Tengku Mohd Tengku. / Weighted Watson-Crick automata. AIP Conference Proceedings. Vol. 1605 American Institute of Physics Inc., 2014. pp. 302-306
@inproceedings{5fa8cc6dda5c441cb244c9af7d5ad2a6,
title = "Weighted Watson-Crick automata",
abstract = "There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power.",
author = "Tamrin, {Mohd Izzuddin Mohd} and Sherzod Turaev and Sembok, {Tengku Mohd Tengku}",
year = "2014",
doi = "10.1063/1.4887606",
language = "English",
isbn = "9780735412415",
volume = "1605",
pages = "302--306",
booktitle = "AIP Conference Proceedings",
publisher = "American Institute of Physics Inc.",

}

TY - GEN

T1 - Weighted Watson-Crick automata

AU - Tamrin, Mohd Izzuddin Mohd

AU - Turaev, Sherzod

AU - Sembok, Tengku Mohd Tengku

PY - 2014

Y1 - 2014

N2 - There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power.

AB - There are tremendous works in biotechnology especially in area of DNA molecules. The computer society is attempting to develop smaller computing devices through computational models which are based on the operations performed on the DNA molecules. A Watson-Crick automaton, a theoretical model for DNA based computation, has two reading heads, and works on double-stranded sequences of the input related by a complementarity relation similar with the Watson-Crick complementarity of DNA nucleotides. Over the time, several variants of Watson-Crick automata have been introduced and investigated. However, they cannot be used as suitable DNA based computational models for molecular stochastic processes and fuzzy processes that are related to important practical problems such as molecular parsing, gene disease detection, and food authentication. In this paper we define new variants of Watson-Crick automata, called weighted Watson-Crick automata, developing theoretical models for molecular stochastic and fuzzy processes. We define weighted Watson-Crick automata adapting weight restriction mechanisms associated with formal grammars and automata. We also study the generative capacities of weighted Watson-Crick automata, including probabilistic and fuzzy variants. We show that weighted variants of Watson-Crick automata increase their generative power.

UR - http://www.scopus.com/inward/record.url?scp=84904617861&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84904617861&partnerID=8YFLogxK

U2 - 10.1063/1.4887606

DO - 10.1063/1.4887606

M3 - Conference contribution

AN - SCOPUS:84904617861

SN - 9780735412415

VL - 1605

SP - 302

EP - 306

BT - AIP Conference Proceedings

PB - American Institute of Physics Inc.

ER -