Exhaustive Search Meets DNA Sequencing: A Comprehensive Review of TSP-Based Approaches.

Year : 2024 | Volume :02 | Issue : 02 | Page : –
By
vector

Pallavi M Jhadav,

vector

Pallavi M Jhadav,

vector

Pallavi M Jhadav,

  1. Research scholor, Department of Computer Science and Engineering,University, B.D.T College of Engineering, Davangere Department of Computer Science and Engineering,University, B.D.T College of Engineering, Davangere, Karnataka, India
  2. Research scholor, Department of Computer Science and Engineering,University, B.D.T College of Engineering, Davangere, Karnataka, India
  3. Research Scholor, Department of Computer Science and Engineering,University, B.D.T College of Engineering, Davangere, Karnataka, India

Abstract document.addEventListener(‘DOMContentLoaded’,function(){frmFrontForm.scrollToID(‘frm_container_abs_114127’);});Edit Abstract & Keyword

Exhaustive search is a high computational complex algorithm that checks every possibility to obtain the best solution. We illustrate exhaustive search by applying it to three important problems: the traveling salesman problem, the knapsack problem, and the assignment problem. In this paper we took travelling salesman problem to explain about DNA Sequencing. Since, travelling salesman problem (TSP) is an algorithmic problem that finds the shortest route between a set of points or locations that must be visited. TSP can be used to solve DNA sequencing problems by applying DNA computing. DNA sequencing is a crucial process in modern genetics. Traditional methods are often time-consuming and computationally expensive. This study proposes a novel approach to DNA sequencing by framing the problem as a Traveling Salesman Problem (TSP). By leveraging efficient TSP solvers, we reconstruct the original DNA sequence from fragmented reads .Our approach, TSP-Seq , models the DNA sequencing problem as a weighted graph, where nodes represent reads and edges represent overlap between reads. The TSP solver finds the shortest Hamiltonian cycle, corresponding to the most likely DNA sequence. We demonstrate TSP-Seq’s effectiveness on simulated and real-world datasets.

Keywords: DNA Sequencing, Travelling salesman problem, Ant colony algorithm, Gene therapy , Organ transplant .

[This article belongs to International Journal of Bioinformatics and Computational Biology (ijbcb)]

How to cite this article:
Pallavi M Jhadav, Pallavi M Jhadav, Pallavi M Jhadav. Exhaustive Search Meets DNA Sequencing: A Comprehensive Review of TSP-Based Approaches.. International Journal of Bioinformatics and Computational Biology. 2024; 02(02):-.
How to cite this URL:
Pallavi M Jhadav, Pallavi M Jhadav, Pallavi M Jhadav. Exhaustive Search Meets DNA Sequencing: A Comprehensive Review of TSP-Based Approaches.. International Journal of Bioinformatics and Computational Biology. 2024; 02(02):-. Available from: https://journals.stmjournals.com/ijbcb/article=2024/view=0

Full Text PDF

Full Text PDF

References
document.addEventListener(‘DOMContentLoaded’,function(){frmFrontForm.scrollToID(‘frm_container_ref_114127’);});Edit

Regular Issue Subscription Original Research
Volume 02
Issue 02
Received 10/09/2024
Accepted 07/10/2024
Published 18/11/2024
244