Chapter

Rough Sets and Current Trends in Computing

Volume 2005 of the series Lecture Notes in Computer Science pp 386-390

Date:

Discovering Motiv Based Association Rules in a Set of DNA Sequences

  • Hoang KiemAffiliated withFaculty of Information Technology, University of Natural Sciences, HCMC
  • , Do PhucAffiliated withFaculty of Information Technology, University of Natural Sciences, HCMC

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.