Cover Image

Some properties of n-cut splicing on labelled semigraphs

A semigraph is one of the generalization of graphs. Different from the hypergraph, a semigraph generalizes a graph in a straightforward manner where the edges of the graph are depicted as usual lines as in a graph, instead of sets as in a hypergraph. The vertices of the semigraph can be labelled by...

Full description

Saved in:
Bibliographic Details
Main Authors: Abdul Razak, Muhammad Nur Syiham, Wan, Heng Fong, Sarmin, Nor Haniza
Format: Conference or Workshop Item
Published: 2023
Subjects:
QA Mathematics
Online Access:http://eprints.utm.my/108262/
http://dx.doi.org/10.1063/5.0183227
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.108262
record_format eprints
spelling my.utm.1082622024-11-13T06:17:01Z http://eprints.utm.my/108262/ Some properties of n-cut splicing on labelled semigraphs Abdul Razak, Muhammad Nur Syiham Wan, Heng Fong Sarmin, Nor Haniza QA Mathematics A semigraph is one of the generalization of graphs. Different from the hypergraph, a semigraph generalizes a graph in a straightforward manner where the edges of the graph are depicted as usual lines as in a graph, instead of sets as in a hypergraph. The vertices of the semigraph can be labelled by assigning symbols to them and the semigraph is called a labelled semigraph. In graph theory, various concepts can be applied on graphs, for instance the splicing system. Splicing system comprises of the field of formal language theory as well as discrete mathematics which focuses on the recombinants behavior of DNA molecules. Labelled semigraph can depict a problem where the labels hold certain values or properties. In DNA computing, a DNA molecule can be illustrated as a labelled semigraph where each vertex is assigned one label representing the nucleotide or base of the DNA molecule; and its cleavage pattern is described as a notion called n-cut splicing. In this research, the idea of n-cut splicing is applied on labelled semigraphs with one symbol. The number of the vertices in a component of n-cut spliced semigraph is firstly determined. Then, the form and order of the new labelled semigraphs generated by the recombination of the labelled n-cut spliced semigraphs are obtained. Besides that, this research also shows that the 180-degree structure of the newly obtained labelled semigraphs is also one of the results of the recombination. 2023 Conference or Workshop Item PeerReviewed Abdul Razak, Muhammad Nur Syiham and Wan, Heng Fong and Sarmin, Nor Haniza (2023) Some properties of n-cut splicing on labelled semigraphs. In: International Conference on Mathematics, Computational Sciences, and Statistics 2022, ICoMCoS 2022, 2 October 2022-3 October 2022, Surabaya, Indonesia. http://dx.doi.org/10.1063/5.0183227
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
Some properties of n-cut splicing on labelled semigraphs
description A semigraph is one of the generalization of graphs. Different from the hypergraph, a semigraph generalizes a graph in a straightforward manner where the edges of the graph are depicted as usual lines as in a graph, instead of sets as in a hypergraph. The vertices of the semigraph can be labelled by assigning symbols to them and the semigraph is called a labelled semigraph. In graph theory, various concepts can be applied on graphs, for instance the splicing system. Splicing system comprises of the field of formal language theory as well as discrete mathematics which focuses on the recombinants behavior of DNA molecules. Labelled semigraph can depict a problem where the labels hold certain values or properties. In DNA computing, a DNA molecule can be illustrated as a labelled semigraph where each vertex is assigned one label representing the nucleotide or base of the DNA molecule; and its cleavage pattern is described as a notion called n-cut splicing. In this research, the idea of n-cut splicing is applied on labelled semigraphs with one symbol. The number of the vertices in a component of n-cut spliced semigraph is firstly determined. Then, the form and order of the new labelled semigraphs generated by the recombination of the labelled n-cut spliced semigraphs are obtained. Besides that, this research also shows that the 180-degree structure of the newly obtained labelled semigraphs is also one of the results of the recombination.
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 Some properties of n-cut splicing on labelled semigraphs
title_short Some properties of n-cut splicing on labelled semigraphs
title_full Some properties of n-cut splicing on labelled semigraphs
title_fullStr Some properties of n-cut splicing on labelled semigraphs
title_full_unstemmed Some properties of n-cut splicing on labelled semigraphs
title_sort some properties of n-cut splicing on labelled semigraphs
publishDate 2023
url http://eprints.utm.my/108262/
http://dx.doi.org/10.1063/5.0183227
_version_ 1816130045276585984
score 13.244413

Similar Items