UNITED STATES
Unusual Pattern Detection in DNA Database Using KMP Algorithm
|
10.5120/526-687 |
S.Rajesh, S.Prathima and L.S.S.Reddy. Article:Unusual Pattern Detection in DNA Database Using KMP Algorithm. International Journal of Computer Applications 1(22):1–5, February 2010. Published By Foundation of Computer Science. BibTeX
@article{key:article,
author = {S.Rajesh and S.Prathima and L.S.S.Reddy},
title = {Article:Unusual Pattern Detection in DNA Database Using KMP Algorithm},
journal = {International Journal of Computer Applications},
year = {2010},
volume = {1},
number = {22},
pages = {1--5},
month = {February},
note = {Published By Foundation of Computer Science}
}
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.
When we know a particular sequence is the cause for a disease, the trace of the sequence in the DNA and the number of occurrences of the sequence defines the intensity of the disease. As the DNA is a large database, I propose String and Pattern matching algorithms to find out a particular sequence in the given DNA. This paper entirely focuses on a novel approach for detecting the unusual patterns present in the gene database. Also, this paper emphasizes on how the disease can be transformed from parents to their children and efficient method for identifying the presence of the disease on hereditary basis and its impact.
Reference
- Fast Pattern matching in strings, SIAM Journal of computer science, pp323 - 350, 1977, Knuth D., Morris J. and Pratt V.
- 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.
- 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.
- Fast practical Exact and Approximate Pattern Matching in Protein Sequences, C. S. Iliopoulos, Inuka Jayasekera1, and L. Mouchard.
- Whole - Genome DNA Sequencing, IEEE Computer society, 1999, pp33 - 43, Gene Myers.
- A fast string-searching algorithm, Comm. Assoc. Comput. Mach., pp762 - 772, 1977, R S Boyer & J S Moore.
- Occurrences Algorithm for string searching based on Brute-force Algorithm, Journal of Computer Science, 82 - 86, 2006.
- Brute Force Algorithm, Christian Charras.
