Approximate Pattern Matching for DNA Sequence Data
In real world biological applications, most relevant sequences are “similar” instead of exactly the same. It is therefore useful to search patterns using soft computing techniques. Our proposed work uses the fuzzy approach for approximate pattern matching. Given a database of sequences, our aim is to find total number of candidate patterns that will approximately match to the query pattern with specified fault tolerance.We show the complete analysis of approximate matching patterns by fuzzy and exact matching approach. We use DNA sequences of bacteria downloaded from National Center for Biotechnology Information (NCBI).
KeywordsSoft computing fuzzy sets approximate matching exact matching DNA sequence
Unable to display preview. Download preview PDF.
- 3.Gately, E.: Neural Network for Financial Forecasting. John Wiley & Sons, Chichester (1996)Google Scholar
- 4.Misener, S., Krawetz, S.A.: Bioinformatics: Methods and Protocols. Human Press Inc. (2000)Google Scholar
- 6.Luscombe, N.M., Greenbaum, D., Gerstein, M.: What is bioinformatics? A proposed definition and overview of the field. Methods Inf. Med. 40, 346–358 (2001)Google Scholar
- 8.National Center for Biotechnology Information, ftp://ftp.ncbi.nlm.nih.gov/genbank/genomes/bacteria/bacillus-subtilis/AL009126.frn