Discovering Motiv Based Association Rules in a Set of DNA Sequences

  • Hoang Kiem
  • Do Phuc
Conference paper

DOI: 10.1007/3-540-45554-X_47

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2005)
Cite this paper as:
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Hoang Kiem
    • 1
  • Do Phuc
    • 1
  1. 1.Faculty of Information TechnologyUniversity of Natural Sciences, HCMCHCM cityVietnam

Personalised recommendations