Frequent Pattern Mining and Analysis in DNA Subsequence

Author(s):

Kirti L Mirgal , Pillai Institute of Information Technology, Engineering, Media Studies and Research, Panvel, India; Dr. Satishkumar Varma, Pillai Institute of Information Technology, Engineering, Media Studies and Research, Panvel, India

Keywords:

Data Mining, Sequence Mining, Frequent Patterns, Suffix Tree

Abstract:

The Frequent Pattern Mining (FPM) algorithms help to mine sub sequences. The subsequence can be non-contiguous and contiguous patterns. The mining of such patterns is an important problem. The mining of such patterns require efficient mining algorithm. It has various applications like discovery of motifs in DNA sequences, financial industry, the analysis of web log, customer shopping sequences and the investigation of scientific or medical processes etc. A more appropriate algorithm for pattern matching is needed. In this work, the approximate pattern matching algorithm is used for finding approximate subsequence. The proposed method is experimented for matching the frequent approximate sub sequences. This method is used to check whether two or more sequences match or to find the occurrence of such pattern. The method is effective since it will always find the pattern if the pattern exists.

Other Details:

Manuscript Id	:	IJSTEV3I3048
Published in	:	Volume : 3, Issue : 3
Publication Date	:	01/10/2016
Page(s)	:	129-134

Download Article