A black box for online approximate pattern matching

Information and Computation

Volumn 209, Issue 4, 2011, Pages 731-736

  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; APPROXIMATE PATTERN MATCHING; BLACK BOX SOLUTION; BLACK BOXES; DETERMINISTIC ALGORITHMS; EXACT MATCHING; OFF-LINE ALGORITHM; ON-LINE ALGORITHMS; PATTERN SIZE; RUNNING TIME; SLIDING WINDOW; SPACE OVERHEAD;

PATTERN MATCHING;

ALGORITHMS;

EID: 79951569234     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2010.12.007     Document Type: Article

References (22)

1. K. Abrahamson Generalized string matching SIAM Journal on Computing 16 6 1987 1039 1051
2. A. Amir, and M. Farach Efficient 2-dimensional approximate matching of half-rectangular figures Information and Computation 118 1 1995 1 11
3. A. Amir, M. Lewenstein, and E. Porat Faster algorithms for string matching with k mismatches Journal of Algorithms 50 2 2004 257 275
4. 1 metric CPM'05: Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching 2005 Springer 91 103 (Pubitemid 41422517)
5. M.J. Atallah Faster image template matching in the sum of the absolute value of differences measure IEEE Transactions on Image Processing 10 4 2001 659 663 (Pubitemid 32371600)
6. P. Clifford, and R. Clifford Simple deterministic wildcard matching Information Processing Letters 101 2 2007 53 54 (Pubitemid 44781380)
7. P. Clifford, R. Clifford, and C.S. Iliopoulos Faster algorithms for δ,γ-matching and related problems CPM'05: Proceedings of the 17th Annual Symposium on Combinatorial Pattern Matching 2005 Springer 68 78 (Pubitemid 41422515)
8. R. Clifford, K. Efremenko, E. Porat, and A. Rothschild k-Mismatch with don't cares ESA'07: Proceedings of the 15th Annual European Symposium on Algorithms October 2007 151 162
9. R. Clifford, and C. Iliopoulos String algorithms in music analysis Soft Computing 8 9 2004 597 603
10. R. Clifford, and E. Porat A filtering algorithm for k-mismatch with don't cares SPIRE'07: Proceedings of the 14th International Symposium on String Processing and Information Retrieval October 2007 130 136
11. R. Cole, and R. Hariharan Verifying candidate matches in sparse and wildcard matching STOC'02: Proceedings of the 34th Annual ACM Symposium Theory of Computing 2002 592 601 (Pubitemid 35009420)
12. T.H. Cormen, C.E. Leiserson, and R.L. Rivest Introduction to Algorithms 1990 MIT Press
13. M. Fischer, and M. Paterson String matching and other products R. Karp, Proceedings of the 7th SIAM-AMS Complexity of Computation 1971 113 125
14. Michael J. Fischer, and Larry J. Stockmeyer Fast on-line integer multiplication STOC'73: Proceedings of the 5th Annual ACM Symposium on Theory of Computing 1973 67 72
15. M.R. Henzinger, P. Raghavan, S. Rajagopalan, External Memory Algorithms, Chapter Computing on Data Streams, American Mathematical Society, Boston, MA, USA, 1999, pp. 107-118.
16. P. Indyk Faster algorithms for string matching problems: matching the convolution bound FOCS'98: Proceedings of the 39th Annual Symposium Foundations of Computer Science 1998 166 173
17. A. Kalai Efficient pattern-matching with don't cares SODA'02: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms 2002 655 656
18. H. Karloff Fast algorithms for approximately counting mismatches Information Processing Letters 48 2 1993 53 60
19. S.R. Kosaraju, Efficient string matching, Manuscript, 1987.
20. G.M. Landau, and U. Vishkin Efficient string matching with k mismatches Theoretical Computer Science 43 1986 239 249
21. ∞ metric SPIRE'05: Proceedings of the 12th International Symposium on String Processing and Information Retrievale 2005 Springer 331 334
22. S. Muthukrishnan Data streams: algorithms and applications Foundations and Trends in Theoretical Computer Science 1 2 2005