Compressed Pattern Matching in Dna Sequences

We proposed a new compressed pattern matching algorithm in DNA sequences. In this approach, we compress both DNA sequences and patterns by using two bits to represent each A, C, T, G character. Here the process is to find out the specific fingerprint pattern present in the multiple files where the pattern specifies a group of pixels and referred by different colors. Once the origin and destination points are selected then pattern lines are drawn to display the patterns present in both the files. After pattern lines are generated the pixel values are retrieved to match whether two patterns formed in both files are similar. If the patterns contain the same values then it is found to be equal. If both the patterns contain distinct values then it is not equal. With the help of this fingerprint patterns the users can obtain safe and secure to system.