Finding frequent patterns in a string in sublinear time

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 746-757

  Berenbrink, Petra ^a   Ergun, Funda ^a   Friedetzky, Tom ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b DURHAM UNIVERSITY   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; MATHEMATICAL MODELS; PROBLEM SOLVING; QUERY LANGUAGES;

FINITE ALPHABETS; SUBLINEAR TIME; TESTING MODELS;

FINITE ELEMENT METHOD;

EID: 27144502689     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_66     Document Type: Conference Paper

References (10)

1. T. Batu, F. Ergun, J. Kilian, A. Magen, S. Raskhodnikova, R. Rubinfeld and R. Sami. A sublinear algorithm for weakly approximating edit distance, STOC 2003, 316-324.
2. F. Ergun, S. Muthukrishnan, and C. Sahinalp, Sublinear methods for detecting periodic trends in data streams. Latin American Symposium on Theoretical Informatics (LATIN), 2004.
3. O. Goldreich, S. Goldwasser and D. Ron. Property testing and its connection to learning and approximation, Journal of the ACM 45(4):653-750, 1998.
4. T. Hagerup and C. Rüb. A Guided Tour of Chernoff Bounds. Information Processing Letters 33 (1989), pp. 305-308.
5. P. Indyk, N. Koudas and S. Muthukrishnan, Identifying Representative Trends in Massive Time Series Data Sets Using Sketches. Proc. VLDB 2000. 363-372.
6. R. Karp, S. Shenker, and C. Papadimitriou, A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28: 51-55 (2003)
7. O. Lachish and I. Newman, Periodicity Testing. Proc. RANDOM 2005, to appear.
8. R. Motwani and P. Raghavan, Randomized Algorithms. Cambridge University Press (1995)
9. D. Ron, Property Testing (A Tutorial). Handbook of Randomization, 2000.
10. R. Rubinfeld and M. Sudan, Robust Characterization of Polynomials with Applications to Program Testing, SIAM Journal of Computing 25(2):252-271, 1996.