Congratulations Puan Durrani Aimi Abdul Malik for Passing her VIVA VOCE

On behalf of the Centre for Mathematical Sciences, we would like to congratulate Puan Durrani Aimi binti Abdul Malik, Master of Science (NEC461) – Field of Research in Mathematics, under the supervision of Assoc. Prof. Dr. Yuhani binti Yusof and co-supervised by Dr. Ku Muhammad Na`im bin Ku Khalif for successfully passing her viva voce on 21st October 2022. The title of her thesis is “Hybrid Fuzzy Analytical Process with Fuzzy Inference System on Ranking STEM Approach towards Blended Learning in Mathematics”

Bio-Mathematical Concepts in DNA Splicing System

Splicing system is a formal characterization of the generative capacity of specified enzymatic activities operating on specified set of double-stranded DNA molecules

n-cutting site of DNA splicing language for single string and palindromic rule

A new symbolization of Yusof-Goode (Y-G) splicing system was introduced by Yusof in 2012, is inspired by the framework of Formal Language Theory introduced by Head in 1987. Y-G splicing system is intended to present the biological process of DNA splicing in a translucent way. In this paper, starting with some relevant preliminaries, one theorem is proposed via Y-G approach using one initial string and one rule with different characteristics of the restriction enzyme. Additionally, the theorem showed the behavior of the splicing languages generated at single stage splicing. Two cases are considered in the theorem by conducting splicing using palindromic rule and palindromic recognition site with same left and right context for Case I and different left and right context for Case II. Furthermore, two molecular examples are discussed to validate two cases proposed in the theorem, which shows the real meaning of the theorem in biological aspect. From the proposed theorem, based on the splicing language generated, the type of splicing language can be determined. It is discovered that, the generated languages are in the form of limit and transient

Persistency And Permanency of Two Stages DNA Splicing Languages with Respect to One Initial String and Two Rules Via Yusof-Goode (Y-G) Approach

The notion of Yusof-Goode (Y-G) splicing system was first schemed by Yusof to study the relationship between formal language theory and molecular biology. The splicing languages that are produced by splicing system have some important characteristics called persistent and permanent. In biological perspective, the recombinant DNA molecules can be manipulated by recombination action if they have persistent property. Thus, the persistency as well as permanency of splicing languages (recombinant DNA molecules) is considered to be an interesting topic in the field of DNA recombination, particularly when the recombination process is accomplished at second stage. Conducting a wet-lab experiment to show the mentioned properties of splicing languages are time consuming and expensive. Therefore, to overcome this problem, mathematical approach is chosen to investigate the persistency and permanency of splicing languages which will be then given as theorem and corollary. Thus, an initial string (with two recognition sites) and two rules are considered for introducing the above characteristics using Y-G approach

The representation of n-cutting site splicing languages for a single string with palindromic rule via de Bruijn graph

Yusof-Goode (Y-G) splicing system proposed by Yusof illustrates the deoxyribonucleic acid (DNA) splicing process in a luminous way, where the rule is written in a double triple notation. In the process of generating splicing languages, DNA molecules are cut and pasted, based on the reaction of the molecules with restriction enzyme and ligase. The resulting molecules, either in original or new molecules can be classified mathematically in the form of limit, adult or transient languages. Conducting a wet lab experiment to produce splicing languages is a huge investment, thus mathematical approach is one of the best options in predicting the outcome on splicing languages when n-cutting site exist in a splicing process. Besides the generation of splicing languages through splicing system, a meaningful representation of the languages can be portrayed in a graph. In this paper, the n-cutting site splicing languages generated from Y-G splicing system containing single string with 2-cutting site, with palindromic rule and palindromic crossing site is investigated. The features of left and right contexts of the rule are considered in the two cases discussed in this paper. Besides, two new definitions namely connectors and sub-connectors are given and are adopted in the generation of de Bruijn graph. With the constructed de Bruijn graph for the resulting splicing languages from both cases, a theorem is proposed

Automorphisms of finite cyclic 3-groups

A distinct compatible pair of actions will result in distinct nonabelian tensor products. This proves that the number of compatible pairs of action plays a huge role as the greatest variety nonabelian tensor product relies on it. However, the actions of finite cyclic group are defined by automorphisms, thus the number of automorphisms needs to be known before obtaining the number of actions that are compatible with one another. This paper focuses on determining the automorphism finite cyclic 3-groups. The general presentation of the automorphism of such groups is obtained with the help of Groups, Algorithm, and Programming (GAP) Software

Biomolecular aspects of second order limit language

The study on the recombinant behavior of double-stranded DNA molecules has led to the mathematical modelling of DNA splicing system. The interdisciplinary study is founded from the knowledge of informational macromolecules and formal language theory. A splicing language is resulted from a splicing system. Recently, second order limit language, a type of the splicing language, has been extensively explored. Before this, several types of splicing languages have been experimentally proven. Therefore, in this paper, a laboratory experiment was conducted to validate the existence of a second order limit language. To accomplish it, an initial strand of double-stranded DNA, amplified from bacteriophage lambda, was generated through polymerase chain reaction to generate thousands of copies of double-stranded DNA molecules. A restriction enzyme and ligase were added to the solution to complete the reaction. The reaction mixture was then subjected to polyacrylamide gel electrophoresis to separate biological macromolecules according to their sizes. A mathematical model derived at the early study was used to predict the approximate length of each string in the splicing language. The results obtained from the experiment are then used to verify the mathematical model of a second order limit language. This study shows that the theory on the second order limit language is biologically proven hence the model has been validated

Clustering of rainfall data using k-means algorithm

Clustering algorithms in data mining is the method for extracting useful information for a given data. It can precisely analyze the volume of data produced by modern applications. The main goal of clustering is to categorize data into clusters according to similarities, traits and behavior. This study aims to describe regional cluster pattern of rainfall based on maximum daily rainfall in Johor, Malaysia. K-Means algorithm is used to obtain optimal rainfall clusters. This clustering is expected to serve as an analysis tool for a decision making to assist hydrologist in the water research problem

Guest Speaker for The International Seminar and Global Learning System GLS Program with Binus University

Heartiest congratulations to the three academicians from the Discrete Mathematics panel; Assoc. Prof. Dr. Mohd Sham Mohamad, Assoc. Prof. Dr. Yuhani Yusof and Dr. Amirul Aizad Ahmad Fuad for their contributions as the Guest Speaker for the International Seminar and Global Learning System (GLS) Program with BINUS University, Indonesia between 20-21st March 2023

A bibliometric review on deoxyribonucleic acid (DNA) splicing system

This study objects to provide a communicative review for splicing system, focusing on deoxyribonucleic acid (DNA) published in journals and proceedings indexed by the Scopus database. The method of bibliometric analysis is used to describe and analyze the evolution of publication structure and its various co-relationships such as citation, co-citation, co-authorship, and co-occurrence, among the chosen 174 documents indexed by Scopus. This study gives some insightful direction of research where the most influential documents and authors were determined. Besides, the emerging of technologies in most of the research works conducted previously promote the hybridization of background of studies specifically in mathematics, biology, and computer science. The study is limited to English articles which was published by the Scopus database, ranging from the year of 1983 until 2023. The source is also limited to Scopus journals and proceedings only. As far as the authors are aware, this is the first study to address the splicing system topic from a bibliometric perspective. The authors believe that this bibliometric review will help scholars and researchers to stand firm bases regarding the scientific development of this field of study