EUVIMEDEUVIMED entdecken
Crossref

Modeling n-Cutting Sites of the Non-Palindromic Rule in the Y-G Splicing System via de Bruijn Graphs

N. M. Ruslim, Y. Yusof, M. S. Mohamad, Faisal

Mathematical Modeling and Computing · 2026 · 13 (4) · 1102-1109

DOI: 10.23939/mmc2026.04.1102 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematical Modeling and Computing, 2026. Verfasst von N. M. Ruslim und 3 weiteren Autor:innen. Die Arbeit nennt 22 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Splicing systems inspired by deoxyribonucleic acid (DNA) recombination have been widely studied as a framework for modelling formal languages and computational processes. Among these, the Yusof-Goode (Y-G) splicing system provides a structured methodology for analysing splicing languages. Conventionally, the classification of splicing languages has focused on the sequences of resulting strings. The de Bruijn graph has been extensively used in genomic studies for string representation; however, its application to splicing language classification remains unexplored. This study addresses this gap by investigating the classification of splicing languages generated by the Y-G splicing system, incorporating a string and a non-palindromic rule with different and similar left-right contexts. The generalised splicing language is portrayed using a de Bruijn graph. This approach enables the identification and classification of splicing languages as either limit or transient types. Verification is achieved through a comparison of theoretical results with experimental findings from wet lab studies. The results demonstrate that splicing languages can be effectively generalised, with the left and right contextual features having no significant influence on the outcomes. Furthermore, the de Bruijn graph is validated as a powerful tool for representing and classifying the structural properties of splicing languages. The graphs show agreement between the proposed corollaries and the experimental results in identifying the type of generated languages. These findings enhance the theoretical understanding of splicing systems and establish the de Bruijn graph as a valuable framework for splicing language analysis.

Zitieren

APA

Ruslim, N. M., Yusof, Y., Mohamad, M. S., & Faisal (2026). Modeling n-Cutting Sites of the Non-Palindromic Rule in the Y-G Splicing System via de Bruijn Graphs. Mathematical Modeling and Computing, 13(4), 1102-1109. https://doi.org/10.23939/mmc2026.04.1102

Vancouver

Ruslim NM, Yusof Y, Mohamad MS, Faisal. Modeling n-Cutting Sites of the Non-Palindromic Rule in the Y-G Splicing System via de Bruijn Graphs. Mathematical Modeling and Computing. 2026;13(4):1102-1109. doi:10.23939/mmc2026.04.1102

BibTeX
@article{Ruslim2026,
  author = {Ruslim, N. M. and Yusof, Y. and Mohamad, M. S. and Faisal},
  title = {Modeling n-Cutting Sites of the Non-Palindromic Rule in the Y-G Splicing System via de Bruijn Graphs},
  journal = {Mathematical Modeling and Computing},
  year = {2026},
  volume = {13},
  number = {4},
  pages = {1102--1109},
  doi = {10.23939/mmc2026.04.1102}
}
Kostenlos starten →