Graph Reduction Algorithm on Graph of 2-mers for DNA Sequences

Authors

  • Wan Heng Fong Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310, Johor Bharu, Johor, Malaysia
  • Kee Yeong Chua Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310, Johor Bharu, Johor, Malaysia
  • Sherzod Turaev Department of Computer Science and Software Engineering, College of Information Technology, United Arab Emirates University, P.O. Box 15551. Al Ain, United Arab Emirates

Keywords:

DNA sequences, graph theory, graph reduction, algorithm

Abstract

In bioinformatics, graph-theoretical techniques are used to mathematically model DNA sequences. The term graph of -mers refers to a directed and weighted graph which uses DNA subsequences or fragments of length  as the vertices. The edges of this graph correspond to the bases between the vertices. In this research, a graph reduction algorithm on the graph of -mers is designed in C++ programming where duplicate vertices are combined and unnecessary edges are removed. The output of the algorithm presents a reduced graph which preserves essential information of the corresponding DNA sequence. This algorithm provides an automated and scalable framework for DNA sequence analysis by applying graph theory to bioinformatics.

Author Biographies

Wan Heng Fong, Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310, Johor Bharu, Johor, Malaysia

 fwh@utm.my

Kee Yeong Chua, Department of Mathematical Sciences, Faculty of Science, Universiti Teknologi Malaysia, 81310, Johor Bharu, Johor, Malaysia

chuayeong@graduate.utm.my

Sherzod Turaev, Department of Computer Science and Software Engineering, College of Information Technology, United Arab Emirates University, P.O. Box 15551. Al Ain, United Arab Emirates

sherzod@uaeu.ac.ae

Downloads

Published

2026-06-08

Issue

Vol. 10 No. 1: June (2026)

Section

Articles