CFP last date
20 December 2024
Reseach Article

Article:Unusual Pattern Detection in DNA Database Using KMP Algorithm

by S.Rajesh, S.Prathima, L.S.S.Reddy
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 1 - Number 22
Year of Publication: 2010
Authors: S.Rajesh, S.Prathima, L.S.S.Reddy
10.5120/526-687

S.Rajesh, S.Prathima, L.S.S.Reddy . Article:Unusual Pattern Detection in DNA Database Using KMP Algorithm. International Journal of Computer Applications. 1, 22 ( February 2010), 1-5. DOI=10.5120/526-687

@article{ 10.5120/526-687,
author = { S.Rajesh, S.Prathima, L.S.S.Reddy },
title = { Article:Unusual Pattern Detection in DNA Database Using KMP Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { February 2010 },
volume = { 1 },
number = { 22 },
month = { February },
year = { 2010 },
issn = { 0975-8887 },
pages = { 1-5 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume1/number22/526-687/ },
doi = { 10.5120/526-687 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T19:47:42.574822+05:30
%A S.Rajesh
%A S.Prathima
%A L.S.S.Reddy
%T Article:Unusual Pattern Detection in DNA Database Using KMP Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 1
%N 22
%P 1-5
%D 2010
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Bioinformatics is the application of computer technology to the management and analysis of biological data. The result is that computers are being used to gather, store, analyze and merge biological data. The goal of bio-informatics is to uncover the wealth of biological information hidden in the mass of data and obtains a clearer insight into the fundamental biology of organisms. The most well known application of bioinformatics is sequence analysis. In sequence analysis, DNA sequences of various diseases are stored in databases for easy retrieval and comparison.

References
  1. Fast Pattern matching in strings, SIAM Journal of computer science, pp323 - 350, 1977, Knuth D., Morris J. and Pratt V.
  2. String matching with k differences by finite automata. In Proceedings of the International Congress on Pattern Recognition (ICPR'96). IEEE CS Press, Silver Spring, MD, 1996. 256-260, Melichar.B.
  3. A Minimum Cost Process in Searching for a Set of similar DNA Sequence, International conference on Telecommunications and Informatics, May 2006, pp348 - 353, Saman, Rahman, Ahmad, Osman.
  4. Fast practical Exact and Approximate Pattern Matching in Protein Sequences, C. S. Iliopoulos, Inuka Jayasekera1, and L. Mouchard.
  5. Whole - Genome DNA Sequencing, IEEE Computer society, 1999, pp33 - 43, Gene Myers.
  6. A fast string-searching algorithm, Comm. Assoc. Comput. Mach., pp762 - 772, 1977, R S Boyer & J S Moore.
  7. Occurrences Algorithm for string searching based on Brute-force Algorithm, Journal of Computer Science, 82 - 86, 2006.
  8. Brute Force Algorithm, Christian Charras.
Index Terms

Computer Science
Information Sciences

Keywords

Bio informatics pattern matching sequence analysis disease identification KMP algorithm DNA failure function