A STUDY ON ALGORITHMIC APPROACH ON DNA SEQUENCE USING GRAPH THEORY
DNA sequence, Fragments, Hamiltonian path, SCS problems, SBH problem, TSP problem
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.
"A STUDY ON ALGORITHMIC APPROACH ON DNA SEQUENCE USING GRAPH THEORY", IJSDR - International Journal of Scientific Development and Research (www.IJSDR.org), ISSN:2455-2631, Vol.2, Issue 5, page no.253 - 258, May-2017, Available :https://ijsdr.org/papers/IJSDR1705043.pdf
Volume 2
Issue 5,
May-2017
Pages : 253 - 258
Paper Reg. ID: IJSDR_170230
Published Paper Id: IJSDR1705043
Downloads: 000347035
Research Area: Engineering
Country: -, -, India
ISSN: 2455-2631 | IMPACT FACTOR: 9.15 Calculated By Google Scholar | ESTD YEAR: 2016
An International Scholarly Open Access Journal, Peer-Reviewed, Refereed Journal Impact Factor 9.15 Calculate by Google Scholar and Semantic Scholar | AI-Powered Research Tool, Multidisciplinary, Monthly, Multilanguage Journal Indexing in All Major Database & Metadata, Citation Generator
Publisher: IJSDR(IJ Publication) Janvi Wave