An Algorithm to Find Eulerian Paths in a Graph and Applications to Bioinformatics


Abstract views: 40 / PDF downloads: 47

Authors

  • Adishankara Mallik 415 Cayuga Circle, Mars, Pennslyvania, 16046, United States

Keywords:

Applications of graph theory, Genetics, Algorithms, Eulerian Paths and Cycles, Bioinformatics

Abstract

We consider a discrete mathematical model to determine the genetic sequence using a list of k-mers from genetic analysis results. We analyze the methods by which to create this program by walking the reader through the process of coding and concepts of the model. Specifically, how a Eulerian path can construct an entire genome from a random list of genetic information broken into chunks.

Downloads

Published

15-06-2021

How to Cite

Adishankara Mallik. (2021). An Algorithm to Find Eulerian Paths in a Graph and Applications to Bioinformatics. International Journal of Mathematics And Its Applications, 9(2), 195–207. Retrieved from http://ijmaa.in/index.php/ijmaa/article/view/86

Issue

Vol. 9 No. 2 (2021)

Section

Research Article

License

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.