Kiem H., Phuc D. (2001) Discovering Motiv Based Association Rules in a Set of DNA Sequences. In: Ziarko W., Yao Y. (eds) Rough Sets and Current Trends in Computing. RSCTC 2000. Lecture Notes in Computer Science, vol 2005. Springer, Berlin, Heidelberg
The research of similarity between DNA sequences is an important problem in Bio-Informatics. In the traditional approach, the dynamic programming based pair-wise alignment is used for measuring the similarity between two sequences. This method does not work well in a large data set. In this paper, we consider motifs like the phrase of document and use text mining techniques for finding the frequent motifs, maximal frequent motifs, motif based association rules in a group of genes.