A Review on Mining Approximate Circular Pattern

Abstract

Pattern matching is the process of finding occurrences of a pattern string in a text or character string. Pattern matching is the basic requirement in many applications such as spell checking, spam filtering, geometry, network traffic data, DNA and protein sequences, etc. Circular Pattern occurs in the DNA of bacteria, viruses, archaea, etc. A linear string having length n can be considered as a circular string, in which end symbols are connected thus forming a circular string. The circular string is considered as n different linear strings, all will be considered equal. Nowadays biologists are interested in finding the approximate patterns. Approximate pattern matching is the technique of finding pattern string that match a pattern approximately rather than exactly. In practical experiments errors may occur due to natural mutations in the DNA of virus, practical limitations of the lab equipments that may introduce errors, etc. Due to these reasons we need to find the approximate circular patterns. The proposed work aims to find the presence of approximate circular pattern with k number of mismatches from the input stream. If the approximate circular pattern exists the system will return the pattern. Also the system finds the presence of any pattern in the input stream.