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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
A Chouchoulas and Q. Shen, A Rough Set based approach to text classification, In the Proceedings of RFDGRC99 international conference, Yamaguchi-UBE, Japan, 1999.
Anders Krogh: An introduction to Hidden Markov Models for Biological Sequences, Computer Methods in Molecular Biology, Elservier, 1998
Hoang Kiem, Do Phuc: Discovering the binary and fuzzy association rules from database: hi the proceedings of the AFSS2000 international conference, Tsukuba, Japan, 2000
Hoang Kiem, Do Phuc: On the Extension of lower approximation in rough set theory for classification problem in data mining, the WCC2000 conference, Beijing, August 2000 (to be accepted for presentation).
Timothy L. Bailey: Discovering motifs in DNA and protein sequence: the approximate common sub-string problem: Ph D dissertation, Univ California, San Diego, USA, 1995
Robert Giegerich and David Wheeler: Pair wise Sequence Alignment, 1996 website: http://www.techfak.uni-bielefeld.de/bcd/Curric/PrwAli/prwali.html
R. Agrawal, R. Srikant, Fast Algorithm for Mining Association Rules in large database, Research report RJ, IBM Almaden Research Center, San Jose, CA,1994
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-45554-X_47
Download citation
DOI: https://doi.org/10.1007/3-540-45554-X_47
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43074-2
Online ISBN: 978-3-540-45554-7
eBook Packages: Springer Book Archive