References

Al Hasan, M., V. Chaoji, S. Salem, J. Besson and M.J. Zaki, 2007. Origami: Mining representative orthogonal graph patterns. Proceedings of the 7th IEEE International Conference on Data Mining, October 28-31, 2007, Omaha, Nebraska, USA., pp: 153-162.

Apostolico, A., S. Browne and C. Guerra, 1992. Fast linear-space computations of longest common subsequences. Theor. Comput. Sci., 92: 3-17.
CrossRef  |  

Chen, C., C.X. Lin, X. Yan and J. Han, 2008. On effective presentation of graph patterns: A structural representative approach. Proceedings of the 17th ACM Conference on Information and Knowledge Management, October 26-30, 2008, Napa Valley, CA., USA., pp: 299-308.

Chen, Y., A. Wan and W. Liu, 2006. A fast parallel algorithm for finding the longest common sequence of multiple biosequences. BMC Bioinformat., Vol. 7. 10.1186/1471-2105-7-S4-S4

Cheung, C.F., J.X. Yu and H. Lu, 2005. Constructing suffix tree for gigabyte sequences with megabyte memory. IEEE Trans. Knowl. Data Eng., 17: 90-105.
CrossRef  |  

Chin, F.Y. and C.K. Poon, 1991. A fast algorithm for computing longest common subsequences of small alphabet size. J. Inform. Process., 13: 463-469.

Elfeky, M.G., W.G. Aref and A.K. Elmagarmid, 2005. Periodicity detection in time series databases IEEE Trans. Knowl. Data Eng., 17: 875-887.
CrossRef  |  

Elfeky, M.G., W.G. Aref and A.K. Elmagarmid, 2005. WARP: Time warping for periodicity detection. Proceedings of the 5th IEEE International Conference on Data Mining, November 27-30, 2005, Houston, Texas, USA., pp: 138-145.

Hakata, K. and H. Imai, 1998. Algorithms for the longest common subsequence problem for multiple strings based on geometric maxima. Optim. Methods Software, 10: 233-260.
CrossRef  |  

Han, J. and J. Pei, 2000. Mining frequent patterns by pattern-growth: Methodology and implications. ACM Sigkdd Explor. Newslett., 2: 14-20.
CrossRef  |  Direct Link  |  

Han, J. and M. Kamber, 2006. Data Mining: Concepts and Techniques. 2nd Edn., Morgan Kaufmann Publishers, San Francisco, CA., USA., ISBN-13: 9781558609013, Pages: 800.

Han, J., G. Dong and Y. Yin, 1999. Efficient mining of partial periodic patterns in time series database. Proceedings of the 1999 International Conference on Data Engineering, March 23-26, 1999, Sydney, Australia, pp: 106-115.

Han, J., L.V. Lakshmanan and R.T. Ng, 1999. Constraint-based, multidimensional data mining. Computer, 32: 46-50.
CrossRef  |  

Han, J., W. Gong and Y. Yin, 1998. Mining segment-wise periodic patterns in time related databases. Proceedings of the 4th International Conference on Knowledge Discovery and Data Mining, August 27-31, 1998, New York, USA., pp: 214-218.

Hansen, L.K., 1994. Book review: Time series prediction: Forecasting the future and understanding the past, Eds. Andreas S. Weigend and Neil A. Gershenfeld. Int. J. Neural Syst., 5: 157-158.
CrossRef  |  

Hettich, S., C.L. Blake and C.J. Merz, 1998. UCI repository of machine learning databases. Department of Information and Computer Science, University of California, Irvine, CA., USA.

Huang, K.Y. and C.H. Chang, 2005. SMCA: A general model for mining asynchronous periodic patterns in temporal databases. IEEE Trans. Knowl. Data Eng., 17: 774-785.
CrossRef  |  

Indyk, P., N. Koudas and S. Muthukrishnan, 2000. Identifying representative trends in massive time series data sets using sketches. Proceedings of the 26th International Conference on Very Large Data Bases, September 10-14, 2000, Cairo, Egypt, pp: 363-372.

Kim, W.Y., Y.K. Lee and J. Han, 2004. Ccmine: Efficient mining of confidence-closed correlated patterns. Proceedings of the 8th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining, May 26-28, 2004, Sydney, Australia, pp: 569-579.

Lee, S.D. and L. De Raedt, 2004. Constraint Based Mining of First Order Sequences in SeqLog. Database Support for Data Mining Applications, Meo, R., P.L. Lanzi and M. Klemettinen (Eds.). Springer, Berlin, Germany, ISBN-13: 9783540224792,-pp: 154-173.

Lu, M. and H. Lin, 1994. Parallel algorithms for the longest common subsequence problem. IEEE Trans. Parallel Distrib. Syst., 5: 835-848.
CrossRef  |  

Maier, D., 1978. The complexity of some problems on subsequences and supersequences. J. ACM, 25: 322-336.

Ng, R., L.V.S. Lakshmanan, J. Han and A. Pang, 1998. Exploratory mining and pruning optimizations of constrained associations rules. ACM SIGMOD Rec., 27: 13-24.
Direct Link  |  

Omiecinski, E.R., 2003. Alternative interest measures for mining associations in databases. IEEE Trans. Knowl. Data Eng., 15: 57-69.
CrossRef  |  

Pei, J. and J. Han, 2002. Constrained frequent pattern mining: A pattern-growth view. ACM SIGKDD Explorat., 4: 31-39.

Rasheed, F., M. Alshalalfa and R. Alhajj, 2011. Efficient periodicity mining in time series databases using suffix trees. IEEE Trans. Knowledge Data Eng., 23: 79-94.
CrossRef  |  

Sakurai, Y., S. Papadimitriou and C. Faloutsos, 2005. BRAID: Stream mining through group lag correlations. Proceedings of the ACM SIGMOD International Conference on Management of Data, June 13-17, 2005, Baltimore, MD., USA., pp: 599-610.

Sheng, C., W. Hsu and M.L. Lee, 2006. Mining dense periodic patterns in time series data. Proceedings of the 22nd International Conference on Data Engineering, April 3-7, 2006, Atlanta, GA., USA., pp: 115-115.

Wang, Q., D. Korkin and Y. Shang, 2011. A fast Multiple Longest Common Subsequence (MLCS) algorithm. IEEE Trans. Knowl. Data Eng., 23: 321-334.
CrossRef  |  

Yan, X. and J. Han, 2002. gSpan: Graph-based substructure pattern mining. Proceedings of the 2002 IEEE International Conference on Data Mining, December 9-12, 2002, Maebashi, Japan, pp: 721-724.

Zhu, Y. and D. Shasha, 2003. Warping indexes with envelope transforms for query by humming. Proceedings of the ACM SIGMOD International Conference on Management of Data, June 9-12, 2003, San Diego, CA., USA., pp: 181-192.