Compact recognizers of episode sequences

Information and Computation

Volumn 174, Issue 2, 2002, Pages 180-192

  Apostolico, Alberto ^a,b   Atallah, Mikhail J ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b Purdue University   (United States)

Author keywords

Algorithms; Compact subsequence automaton; DAWG; Forward failure function; Pattern matching; Skip edge DAWG; Skip link; Subsequence and episode searching; Suffix automaton

Indexed keywords

COMPUTER SCIENCE; DATA MINING; DATA STRUCTURES; INFORMATION RETRIEVAL; TEXT PROCESSING;

COMPACT SUBSEQUENCE AUTOMATION;

PATTERN MATCHING;

EID: 0036590449     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2002.3143     Document Type: Article

References (12)

1. Apostolico, A., and Galil, Z. (Eds.) (1997), Pattern Matching Algorithms, Oxford University Press, New York.
2. Apostolico, A., and Guerra, C. (1987), The longest common subsequence problem revisited, Algorithmica 2, 315-336.
3. Baeza-Yates, R. (1991), Searching subsequences, Theoret. Comput. Sci. 78, 373-376.
4. Blumer, A., Blumer, J., Ehrenfeucht, A., Haussler, D., Chen, M. T., and Seiferas, J. (1985), The smallest automaton recognizing the subwords of a text, Theoret. Comput. Sci. 40, 31-55.
5. Cobbs, A. (1995), Fast approximate matchings using suffix trees, in CPM'95, Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching (Z. Galil and E. Ukkonen, Eds.), Lecture Notes in Computer Science, Vol. 937, pp. 41-54, Springer-Verlag, Berlin/New York.
6. Crochemore, M., and Rytter, W. (1994), Text Algorithms, Oxford University Press, New York.
7. Das, G., Fleischer, R., Ga̧sieniek, L., Gunopulos, D., Kärkkäinen, J. (1997), Episode matching, in CPM'97, Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching (A. Apostolico and J. Hein, Eds.), Lecture Notes in Computer Science, Vol. 1264, pp. 12-27, Springer-Verlag, Berlin/New York.
8. Johnson, D. B. (1982), A priority queue in which initialization and queue operations take O(log log n) time, Math. System Theory 15, 295-309.
9. Kumar, S., and Spafford, E. H. (1994), A pattern-matching model for instrusion detection, in Proceedings of the National Computer Security Conference, pp. 11-21.
10. Mannila, H., Toivonen, H., and Vercamo, A. I. (1997), Discovering frequent episodes in event sequences, Data Mining Knowledge Discovery 1, 259-289.
11. Ukkonen, E. (1993), Approximate string matching with suffix trees, in CPM'93, Proceedings of the 4th Annual Symposium on Combinatorial Pattern Matching (A. Apostolico, M. Crochemore, Z. Galil, and U. Manber, Eds.), Lecture Notes in Computer Science, Vol. 684, pp. 228-242, Springer-Verlag, Berlin/New York.
12. Waterman, M. (1995), Introduction to Computational Biology, Chapman & Hall, London.