Publisher
Springer Berlin Heidelberg
Reference6 articles.
1. R.A. Baeza-Yates. Searching subsequences. Theor. Comput. Sci., 78(2):363–376, 1991.
2. L. Boasson, P. Cegielski, I. Guessarian, and Y. Matiyasevich. Window-accumulated subsequence matching problem is linear. In Proceedings of the 18th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pages 327–336, Philadelphia, Pennsylvania, 1999. ACM Press.
3. Lect Notes Comput Sci;G. Das,1997
4. H. Hoshino, A. Shinohara, M. Takeda, and S. Arikawa. Online construction of subsequence automata for multiple texts. In Proceedings of the Symposium on String Processing and Information Retrieval 2000, La Coruña, Spain, 2000. IEEE Computer Society Press.
5. H. Mannila, H. Toivonen, and A.I. Verkamo. Discovering frequent episodes in sequences. In Proceedings of the 1st International Conference on Knowledge Discovery and Data Mining, pages 210–215, Montreal, Canada, 1995. AAAI Press.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献