INTERNATIONAL JOURNAL OF SCIENTIFIC DEVELOPMENT AND RESEARCH International Peer Reviewed & Refereed Journals, Open Access Journal ISSN Approved Journal No: 2455-2631 | Impact factor: 8.15 | ESTD Year: 2016
open access , Peer-reviewed, and Refereed Journals, Impact factor 8.15
A STUDY ON ALGORITHMIC APPROACH ON DNA SEQUENCE USING GRAPH THEORY
Authors Name:
M.Akalya
Unique Id:
IJSDR1705043
Published In:
Volume 2 Issue 5, May-2017
Abstract:
This paper is a study on DNA sequencing by hybridization and reconstructing the DNA molecule based on fragments overlap via Shortest common Superstring (SCS) problem. Some problems are solved with suitable graphical diagrams to justify the algorithm which was developed by Pranab Kalita and Bichitra Kalita to solve the combinatorial part of DNA sequencing by hybridization using graph theoretical concepts to find the Hamiltonian path. Here the spectrum is ideal one and the fragments are of equal length is to be assumed.
Keywords:
DNA sequence, Fragments, Hamiltonian path, SCS problems, SBH problem, TSP problem
Cite Article:
"A STUDY ON ALGORITHMIC APPROACH ON DNA SEQUENCE USING GRAPH THEORY", International Journal of Science & Engineering Development Research (www.ijsdr.org), ISSN:2455-2631, Vol.2, Issue 5, page no.253 - 258, May-2017, Available :http://www.ijsdr.org/papers/IJSDR1705043.pdf
Downloads:
000346979
Publication Details:
Published Paper ID: IJSDR1705043
Registration ID:170230
Published In: Volume 2 Issue 5, May-2017
DOI (Digital Object Identifier):
Page No: 253 - 258
Publisher: IJSDR | www.ijsdr.org
ISSN Number: 2455-2631
Facebook Twitter Instagram LinkedIn