A black box for online approximate pattern matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5029 LNCS, Issue , 2008, Pages 143-151

  Clifford, Raphaël ^a   Efremenko, Klim ^b,c   Porat, Benny ^b   Porat, Ely ^b  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b BAR ILAN UNIVERSITY   (Israel)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE MATCHING; BLACK BOX SOLUTION; BLACK BOXES; EXACT MATCHING; OFF-LINE ALGORITHMS; RUNNING TIME; SLIDING-WINDOW (SW);

PHASE MODULATION;

PATTERN MATCHING;

EID: 45849089972     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69068-9_15     Document Type: Conference Paper

References (21)

1. Abrahamson, K.: Generalized string matching. SIAM journal on Computing 16(6), 1039-1051 (1987)
2. Amir, A., Farach, M.: Efficient 2-dimensional approximate matching of half-rectangular figures. Information and Computation 118(1), 1-11 (1995)
3. 1 metric. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 91-103. Springer, Heidelberg (2005)
4. Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2), 257-275 (2004)
5. Atallah, M.J.: Faster image template matching in the sum of the absolute value of differences measure. IEEE Transactions on Image Processing 10(4), 659-663 (2001)
6. Clifford, P., Clifford, R.: Simple deterministic wildcard matching. Information Processing Letters 101(2), 53-54 (2007)
7. Clifford, P., Clifford, R., Iliopoulos, C.S.: Faster algorithms for δ,γ-matching and related problems. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol. 3537, pp. 68-78. Springer, Heidelberg (2005)
8. Clifford, R., Iliopoulos, C.: String algorithms in music analysis. Soft Computing 8(9), 597-603 (2004)
9. Clifford, R., Efremenko, K., Porat, E., Rothschild, A.: k-mismatch with don't cares. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 151-162. Springer, Heidelberg (2007)
10. Clifford, R., Porat, E.: A filtering algorithm for k-mismatch with don't cares. In: Ziviani, N., Baeza-Yates, R. (eds.) SPIRE 2007. LNCS, vol. 4726, pp. 130-136. Springer, Heidelberg (2007)
11. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
12. Cole, R., Hariharan, R.: Verifying candidate matches in sparse and wildcard matching. In: Proceedings of the Annual ACM Symposium on Theory of Computing, pp. 592-601 (2002)
13. Fischer, M., Paterson, M.: String matching and other products. In: Karp, R. (ed.) Proceedings of the 7th SIAM-AMS Complexity of Computation, pp. 113-125 (1974)
14. Henzinger, M.R., Raghavan, P., Rajagopalan, S.: Computing on data streams. In: External memory algorithms, pp. 107-118. American Mathematical Society, Boston (1999)
15. Indyk, P.: Faster algorithms for string matching problems: Matching the convolution bound. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 166-173 (1998)
16. Kalai, A.: Efficient pattern-matching with don't cares. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 655-656 (2002)
17. Kosaraju, S.R.: Efficient string matching (1987) (manuscript)
18. Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theoretical Computer Science 43, 239-249 (1986)
19. ∞ metric. In: String Processing and Information Retrieval, 12th International Symposium (SPIRE 2005). LNCS, pp. 331-334. Springer, Heidelberg (2005)
20. Muthukrishnan, S.: Data streams: algorithms and applications. In: SODA 2003: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, p. 413 (2003)
21. Tamm, U.: Communication complexity of sum-type functions invariant under translation. Inf. Comput. 116(2), 162-173 (1995)