The week's pick
Random Articles
Reseach Article
Shortest Superstring in DNA Sequencing
by
Rongdeep Pathak,
Bichitra Kalita
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 89 - Number 6 |
| Year of Publication: 2014 |
| Authors: Rongdeep Pathak, Bichitra Kalita |
10.5120/15503-4093
|
Rongdeep Pathak, Bichitra Kalita . Shortest Superstring in DNA Sequencing. International Journal of Computer Applications. 89, 6 ( March 2014), 1-7. DOI=10.5120/15503-4093
@article{
10.5120/15503-4093,
author = {
Rongdeep Pathak,
Bichitra Kalita
},
title = { Shortest Superstring in DNA Sequencing },
journal = {
International Journal of Computer Applications
},
issue_date = { March 2014 },
volume = { 89 },
number = { 6 },
month = { March },
year = { 2014 },
issn = { 0975-8887 },
pages = {
1-7
},
numpages = {9},
url = {
https://ijcaonline.org/archives/volume89/number6/15503-4093/
},
doi = { 10.5120/15503-4093 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:08:30.209547+05:30
%A Rongdeep Pathak
%A Bichitra Kalita
%T Shortest Superstring in DNA Sequencing
%J International Journal of Computer Applications
%@ 0975-8887
%V 89
%N 6
%P 1-7
%D 2014
%I Foundation of Computer Science (FCS), NY, USA
Abstract
In this paper, a new algorithm has been developed applying graph theoretical approach to study the shortest superstring from a DNA spectrum having variable and fixed length of fragments.
References
- Adleman LM, Molecular computation of solution to combinatorial problems, Science, 266: 1021-1024, 1994
- MS Wateman, Introduction to computational biology, Maps, sequences and Genomes, Chapman & Hall , London, 1995.
- J Setubal and J Meidanis, Introduction to computational molecular biology, PWS Publishing Company, Boston, 1997.
- Adleman LM, Computing with DNA, Scientific American, 29(2), 54-61, 1998.
- PA Pevzner, Computational Molecular biology, an algorithmic approach, MIT Press, Cambridge, 2000.
- J Blazewicz and M Kasprzak, Complexity of DNA sequencing by hybridization , Theatrical computer science 290, 1459-1473, 2003.
- M Kasprzak, On the link between DNA sequencing and graph theory, Computational Methods in Science and Technolgy, 10, 39-47, 2004.
- JY Lee, SY Shin, TH Park, BT Zhng, Solving travelling salesman problems with DNA molecule encoding numerical values, Biosystems, Elsevier, 2004
- K Mehdizadeh, MA Nekoui, K Sabahi and A Akbarimajd, A modified DNA computing algorithm to solve TSP, IEEE, 2006.
- P Kalita and B Kalita, A graph theoretical algorithmic approach for DNA sequencing, IOSR, Vol. 5 issue 1, 40-46, 2013.
Index Terms
Computer Science
Information Sciences
Keywords