| Autor: |
S. Ravikanth, Allam Apparao, P. Sankarrao, K. V. S. R. P. Varma, E. Vamsidhar |
| Rok vydání: |
2010 |
| Předmět: |
|
| Zdroj: |
2010 IEEE International Conference on Computational Intelligence and Computing Research. |
| DOI: |
10.1109/iccic.2010.5705841 |
| Popis: |
The Human genome project raises the curtain to solve the Biological problems in much more sophisticated manner. The Biological data is huge and increasing at faster rate. The computational approach (Insilco) is much needed to analyze these huge biological data. Pattern matching emerges as a powerful tool in locating nucleotide or amino acid sequence patterns in the genomic sequence databases, although several pattern matching algorithms are available in literature, the efficiency of various algorithms depends on faster and exact identification of the pattern in the sequence. In this article a Novel approach is proposed to solve the problem of finding tandem repeats patterns in the given sequence by combining the preprocessing method (PDFMCSP) with pattern searching method TSW. PBFMCSP is used to preprocess the sequence string using the concept of inverted matrix and frequently occurring pattern. The frequently occurring patterns are searched in the input sequence string using Two Sliding Window method (TSW) in which the string is scanned from both the sides at a time. The searching is stopped when both the windows converge. |
| Databáze: |
OpenAIRE |
| Externí odkaz: |
|
