The Maximal Frequent Pattern mining of DNA sequence

Abstract

The DNA sequence data is one of the basic and important data among biological data. The DNA sequence pattern mining has got wide attention and rapid development. Traditional algorithms for the sequential pattern mining may generate lots of redundant patterns when dealing with the DNA sequence. The Maximal Frequent Pattern is preferable to express the function and structure of the DNA sequence. Base on the characteristics of the DNA sequence, the author develops the Joined Maximal Pattern Segments algorithm—JMPS, for the maximal frequent patterns mining of the DNA sequence. First, the maximal frequent pattern segments base on adjacent generated. Then, longer Maximal Frequent Pattern can be obtained by combining the above segments, at the same time deleting the Non-maximal patterns. The algorithm can deal with the DNA sequence data efficiently.