Folding technique on n-cut spliced semigraph in splicing system
In biology, DNA splicing system models the recombination behaviours of DNA molecules which require the presence of restriction enzymes. Since it is quite incompetent to describe DNA splicing system in one-dimensional string, hence graph theory is used in describing the complexity of DNA splicing sys...
Saved in:
Main Authors: | , , |
---|---|
Format: | Conference or Workshop Item |
Published: |
2020
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/94050/ http://dx.doi.org/10.1063/5.0026045 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.utm.94050 |
---|---|
record_format |
eprints |
spelling |
my.utm.940502022-02-28T13:24:04Z http://eprints.utm.my/id/eprint/94050/ Folding technique on n-cut spliced semigraph in splicing system Abdul Razak, Muhammad Nur Syiham Wan, Heng Fong Sarmin, Nor Haniza QA Mathematics In biology, DNA splicing system models the recombination behaviours of DNA molecules which require the presence of restriction enzymes. Since it is quite incompetent to describe DNA splicing system in one-dimensional string, hence graph theory is used in describing the complexity of DNA splicing system. Thus by graph splicing system, a type of semigraph can be obtained, called as n-cut spliced semigraph. Various concepts of graph theory have been applied on semigraph to study its characteristics and properties. In this study, the focus is on the application of the folding technique on n-cut spliced semigraph.It is observed that the maximum number of folding for every n-cut spliced semigraph is n+1 times. Also, the final form of new semigraphs obtained are determined. 2020 Conference or Workshop Item PeerReviewed Abdul Razak, Muhammad Nur Syiham and Wan, Heng Fong and Sarmin, Nor Haniza (2020) Folding technique on n-cut spliced semigraph in splicing system. In: 27th National Symposium on Mathematical Sciences, SKSM 2019, 26 - 27 November 2019, Bangi, Selangor. http://dx.doi.org/10.1063/5.0026045 |
institution |
Universiti Teknologi Malaysia |
building |
UTM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Teknologi Malaysia |
content_source |
UTM Institutional Repository |
url_provider |
http://eprints.utm.my/ |
topic |
QA Mathematics |
spellingShingle |
QA Mathematics Abdul Razak, Muhammad Nur Syiham Wan, Heng Fong Sarmin, Nor Haniza Folding technique on n-cut spliced semigraph in splicing system |
description |
In biology, DNA splicing system models the recombination behaviours of DNA molecules which require the presence of restriction enzymes. Since it is quite incompetent to describe DNA splicing system in one-dimensional string, hence graph theory is used in describing the complexity of DNA splicing system. Thus by graph splicing system, a type of semigraph can be obtained, called as n-cut spliced semigraph. Various concepts of graph theory have been applied on semigraph to study its characteristics and properties. In this study, the focus is on the application of the folding technique on n-cut spliced semigraph.It is observed that the maximum number of folding for every n-cut spliced semigraph is n+1 times. Also, the final form of new semigraphs obtained are determined. |
format |
Conference or Workshop Item |
author |
Abdul Razak, Muhammad Nur Syiham Wan, Heng Fong Sarmin, Nor Haniza |
author_facet |
Abdul Razak, Muhammad Nur Syiham Wan, Heng Fong Sarmin, Nor Haniza |
author_sort |
Abdul Razak, Muhammad Nur Syiham |
title |
Folding technique on n-cut spliced semigraph in splicing system |
title_short |
Folding technique on n-cut spliced semigraph in splicing system |
title_full |
Folding technique on n-cut spliced semigraph in splicing system |
title_fullStr |
Folding technique on n-cut spliced semigraph in splicing system |
title_full_unstemmed |
Folding technique on n-cut spliced semigraph in splicing system |
title_sort |
folding technique on n-cut spliced semigraph in splicing system |
publishDate |
2020 |
url |
http://eprints.utm.my/id/eprint/94050/ http://dx.doi.org/10.1063/5.0026045 |
_version_ |
1726791473582571520 |
score |
13.18916 |