Gautam Das, Rudolf Fleischer, Leszek Gasieniec, Dimitris Gunopulos, Juha Karkkainen  Home/Search
Context Related
| cs.helsinki.fi/~tpkarkka/cpm97.ps.gz cs.helsinki.fi/u/tpkarkka...cpm97.ps.gz csc.liv.ac.uk/~leszek...cpm97epi.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.helsinki.fi/~tpkarkka/ (more) From: cs.helsinki.fi/u/tpkarkka/ (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: . Given two words, text T of length n and episode P of length m, the episode matching problem is to find all minimal length substrings of text T that contain episode P as a subsequence. The respective optimization problem is to find the smallest number w, s.t. text T has a subword of length w which contains episode P . In this paper, we introduce a few efficient off-line as well as on-line algorithms for the entire problem, where by on-line algorithms we mean algorithms which search from left... (Update)
Similar documents based on text: More All
0.6: Episode Matching - Tronicek (2001) (Correct)
0.4: Rule Discovery From Time Series - Das, Lin, Mannila, Renganathan, Smyth (1998) (Correct)
0.3: The Episode File System - Chutani, Anderson, Kazar, Leverett.. (1992) (Correct)
BibTeX entry: (Update)
G. Das, R. Fleischer, L. Gasieniec, D. Gunopulos, and J. K#rkk#inen. Episode matching. Manuscript, 1997. http://citeseer.ist.psu.edu/das97episode.html More
@inproceedings{ das97episode,
author = "G. Das and R. Fleischer and L. G{\c a}sieniec and D. Gunopulos and J. K{\"a}rkk{\"a}inen",
title = "Episode matching",
booktitle = "Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching",
number = "1264",
publisher = "Springer-Verlag, Berlin",
address = "Aarhus, Denmark",
editor = "A. Apostolico and J. Hein",
pages = "12--27",
year = "1997",
url = "citeseer.ist.psu.edu/das97episode.html" }
Citations (may not include all citations):30 Ullman: The Design and Analysis of Computer Algorithms (context) - Aho, Hopcroft - 1974
5 Wunsch: A general method applicable to the search for simila.. (context) - Needleman - 1970
4 Paterson: A faster algorithm for computing string edit dista.. (context) - Masek - 1980
3 Vishkin: Fast parallel and serial approximate string matchin.. (context) - Landau - 1989
3 Wilson: A Course in Combinatorics (context) - van Lint - 1992
2 Park: An improved algorithm for approximate string matching (context) - Galil - 1990
1 Verkamo: Discovering frequent episodes in sequences (context) - Mannila, Toivonen - 1995
1 Myers: A subquadratic algorithm for approximate limited expr.. (context) - Wu, Manber - 1996
1 Toivonen: Discovering frequent episodes in sequences (context) - Mannila - 1996
1 Manber: Agrep -- a fast approximate pattern-matching tool (context) - Wu - 1992
1 Department of Computer Science (context) - Toivonen, Frequent et al. - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.helsinki.fi/~tpkarkka/):
Two and Higher Dimensional Pattern Matching in Optimal.. - Kärkkäinen, Ukkonen (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC