Mining periodic patterns with gap requirement from sequences

ACM Transactions on Knowledge Discovery from Data

Volumn 1, Issue 2, 2007, Pages

  Zhang, Minghua ^a   Kao, Ben ^b   Cheung, David W ^b   Yip, Kevin Y ^c,d  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c YALE UNIVERSITY   (United States)

^d Yale University

Author keywords

Gap requirement; Periodic pattern; Sequence mining

Indexed keywords

BIOINFORMATICS; DATA MINING; PATTERN MATCHING; RANDOM PROCESSES;

GAP REQUIREMENT; PERIODIC PATTERN; SEQUENCE MINING;

TIME VARYING SYSTEMS;

EID: 34548236885     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/1267066.1267068     Document Type: Article

References (24)

1. AGARWAL, R., IMIELINSKI, T., AND SWAMI, A. 1993. Mining association rules between sets of items in large databases. In Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data. ACM, New York, 207-216.
2. ALTSCHUL, S. F., GISH, W., MILLER, W., MYERS, E. W., AND LIPMAN, D. J. 1990. Basic local alignment search tool. J Molec. Biol. 215, 403-410.
3. BAIROCH, A. AND BOECKMANN, B. 1992. The swiss-prot protein sequence data bank. Nucleic Acids Res. 20, Suppl, 2019-2022.
4. BERNARDI, G., OLOFSSON, B., FILIPSKI, J., ZERIAL, M., SALINAS, J., CUNY, G., MEUNIER-ROTIVAL, M., AND RODIER, F. 1985. The mosaic genome of warm-blooded vertebrates. Science 228, 4702, 953-958.
5. COWARD, E. AND DRABLOS, F. 1998. Detecting periodic patterns in biological sequences. Bioinformatics 14, 6, 498-507.
6. FICKETT, J. W. AND TUNG, C. S. 1992. Assessment of protein coding measures. Nucleuic Acids Res. 20, 6441-6450.
7. HAN, J., DONG, G., AND YIN, Y 1999. Efficient mining of partial periodic patterns in time series database. In Proceedings of the 15th International Conference on Data Engineering, (ICDE99). 106-115.
8. HERZEL, H., WEISS, O., AND TRIFONOV, E. N. 1999. 10-11 bp periodicities in complete genomes reflect protein structure and DNA folding. Bioinformatics 15, 3, 187-193.
9. JONASSEN, I. 1996. Efficient discovery of conserved patterns using a pattern graph. Tech. Rep. Report No. 118, University of Bergen.
10. KURTZ, S., OHLEBUSCH, E., SCHLEIERMACHER, C., STOYE, J., AND GIEGERICH, R. 2000. Computation and visualization of degenerate repeats in complete genomes. In Proceedings of the 8th International Conference on Intelligent Systems for Molecular (ISMB-00).
11. MANNILA, H., TOIVONEN, H., AND VERKAMO, A. I. 1997. Discovery of frequent episodes in event sequences. Data Mining and Knowledge Discovery 1, 3 (Nov.), 259-289.
12. NCBI. The National Center for Biotechnology Information web site. http://www.ncbi.nlm.nih.gov.
13. PEI, J., HAN, J., MORTAZAVI-ASL, B., PINTO, H., CHEN, Q., DAYAL, U., AND HSU, M.-C. 2001. Prefixspan: Mining sequential patterns by prefix-projected growth. In Proceedings of the 17th IEEE International Conference on Data Engineering (ICDE) (Heidelberg, Germany). IEEE Computer Society Press, Los Alamitos, CA.
14. REDDY, P. AND HOUSMAN, D. 1997. The complex pathology of trinucleotide repeats. Current Opinion in Cell Biology 9, 3, 364-372.
15. RIGOUTSOS, I. AND FLORATOS, A. 1998. Combinatorial pattern discovery in biological sequences: the teiresias algorithm. Bioinformatics 14, 1.
16. SRIKANT, R. AND AGRAWAL, R. 1996. Mining sequential patterns: Generalizations and performance improvements. In Proceedings of the 5th Conference on Extending Database Technology (EDBT) (Avignion, France).
17. TOMITA, M., WADA, M., AND KAWASHIMA, Y. 1999. ApA dinucleotide periodicity in prokaryote, eukaryote, and organelle genomes. J. Molec. Evolut. 49, 182-192.
18. TRIFONOV, E. N. 1998. 3-, 10.5-, 200- and 400-base periodicities in genome sequences. Physica A 249, 511-516.
19. VAN BELKUM, A., W. VAN LEEUWEN, S. S., WILLEMSE, D., VAN ALPHEN, L., AND VERBRUGH, H. 1997. Variable number of tandem repeats in clinical strains of haemophilus influenzae. Infect. Immun. 65, 12, 5017-5027.
20. WIDOM, J. 1996. Short-range order in two eukaryotic genomes: Relation to chromosome structure. J. Molec. Biol. 259, 579-588.
21. YANG, J., WANG, W., AND YU, P. S. 2000. Mining asynchronous periodic patterns in time series data. In Proceedings of the 6th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (Boston, MA). ACM, New York, 275-279.
22. ZAKI, M. J. 1998. Efficient enumeration of frequent sequences. In Proceedings of the ACM 7th International Conference on Information and Knowledge Management (CIKM'98) (Washington). ACM, New York.
23. ZHANG, M., KAO, B., CHEUNG, D. W., AND YIP, K. Y. 2005. Mining periodic patterns with gap requirement from sequences. In Proceedings of the ACM SIGMOD Conference on Management of Data. ACM, New York.
24. ZHANG, M., KAO, B., YIP, C., AND CHEUNG, D. 2001. A GSP-based efficient algorithm for mining frequent sequences. In Proceedings of IC-AI'2001 (Las Vegas, NV).