Normal view MARC view ISBD view

Persistency and permanency of two stages splicing languages based on DNA recombination process by using Yusof-Goode (Y-G) approach / Mohammad Hassan Mudaber

By:

Mohammad Hassan Mudaber

Material type: Text

TextPublication details: Kuantan, Pahang : UMP, 2015Description: xv, 120 p. : ill. (some col.) ; 30 cm. + 2 CD ROMISBN:

THE0002002(Local)

Subject(s):

Online resources:

Library access only

Dissertation note: Thesis (Master of Science (Mathematics)) -- Universiti Malaysia Pahang – 2015 Abstract: The study of the biological process of deoxyribonucleic acid (DNA) splicing was investigated by Yusof in 2012 as a translucent approach under framework of formal languages theory. The investigation was achieved by proposing a new symbolization representing the rule in splicing system called Yusof-Goode (Y-G) rule associated with Y-G splicing system. A laboratory experiment is usually performed to show the DNA splicing process under the existence of restriction enzyme and appropriate ligase. This laboratory experiment is time consuming process and it can incur a lot of expenses. In addition, to accomplish the reaction up to two stages the generating recombining DNA molecules must have persistency concept. Thus, to overcome this problem, mathematical approach via Y-G model is applied to introduce the new concept of splicing system at two stages with respect to two initial strings and two rules. Furthermore, the existence relation between the families of stage one and stage two splicing languages are investigated. In this investigation, some sufficient conditions for persistency and permanency of two stages DNA splicing languages according to the number of cutting sites of initial strings and properties of rules are provided. The de Bruijn graph is used to predict the persistency and permanency of two stages splicing languages. A user friendly interface as an alternative of wet-lab experiment is coded using Microsoft Visual C Sharp (C#) to predict the persistency and permanency, and the relations between two stages (stage one and stage two) splicing languages.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 5 )
Title notes ( 4 )

Holdings
Item type	Current library	Call number	Copy number	Status	Notes	Barcode
Thesis	UMPLIB GAMBANG	QA267.3 .H37 2015 r Thesis (Browse shelf(Opens below))	1	Not for loan		0000100304
Thesis	UMPLIB GAMBANG	CD 8902 \| QA267.3 .H37 2015 r Thesis (Browse shelf(Opens below))	1	In Transit		0000100306
Thesis	UMPLIB GAMBANG	QA267.3 .H37 2015 r Thesis (Browse shelf(Opens below))	2	In Transit	c.2	0000107803
Thesis	UMPLIB GAMBANG	CD 8867 \| QA267.3 .H37 2015 r Thesis (Browse shelf(Opens below))	2	Not for loan		0000100305
Thesis	UMPLIB GAMBANG	CD 9661 \| QA267.3 .H37 2015 r Thesis (Browse shelf(Opens below))	3	Not for loan	c.3	0000107804

Faculty of Industrial Sciences and Technology

Thesis (Master of Science (Mathematics)) -- Universiti Malaysia Pahang – 2015

Bibliography : p. 112-115

The study of the biological process of deoxyribonucleic acid (DNA) splicing was investigated by Yusof in 2012 as a translucent approach under framework of formal languages theory. The investigation was achieved by proposing a new symbolization representing the rule in splicing system called Yusof-Goode (Y-G) rule associated with Y-G splicing system. A laboratory experiment is usually performed to show the DNA splicing process under the existence of restriction enzyme and appropriate ligase. This laboratory experiment is time consuming process and it can incur a lot of expenses. In addition, to accomplish the reaction up to two stages the generating recombining DNA molecules must have persistency concept. Thus, to overcome this problem, mathematical approach via Y-G model is applied to introduce the new concept of splicing system at two stages with respect to two initial strings and two rules. Furthermore, the existence relation between the families of stage one and stage two splicing languages are investigated. In this investigation, some sufficient conditions for persistency and permanency of two stages DNA splicing languages according to the number of cutting sites of initial strings and properties of rules are provided. The de Bruijn graph is used to predict the persistency and permanency of two stages splicing languages. A user friendly interface as an alternative of wet-lab experiment is coded using Microsoft Visual C Sharp (C#) to predict the persistency and permanency, and the relations between two stages (stage one and stage two) splicing languages.