K-mismatch with don't cares

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

Volumn 4698 LNCS, Issue , 2007, Pages 151-162

  Clifford, Raphaël ^a   Efremenko, Klim ^b,c   Porat, Ely ^b   Rothschild, Amir ^b,d  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b BAR ILAN UNIVERSITY   (Israel)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^d TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; IMAGE MATCHING; IMAGE PROCESSING; PROBABILITY;

NON TRIVIAL ALGORITHMS; RANDOMISED SOLUTION; TIME PREPROCESSING;

PATTERN RECOGNITION;

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

References (19)

1. Abrahamson, K.: Generalized string matching. SIAM journal on Computing 16(6), 1039-1051 (1987)
2. Akutsu, T.: Approximate string matching with don't care characters. Information Procesing Letters 55, 235-239 (1995)
3. Amir, A., Lewenstein, M., Porat, E.: Faster algorithms for string matching with k mismatches. J. Algorithms 50(2), 257-275 (2004)
4. Boyer, R.S., Moore, J.S.: A fast string matching algorithm. Communications of the ACM 20, 762-772 (1977)
5. Chlebus, B.S., Kowalski, D.R.: Almost optimal explicit selectors. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, Springer, Heidelberg (2005)
6. Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms (SODA '01), pp. 709-718. ACM Press, New York (2001)
7. Clifford, P., Clifford, R.: Simple deterministic wildcard matching. Information Processing Letters 101(2), 53-54 (2007)
8. 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. ACM Press, New York (2002)
9. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
10. Dorfman, R.: The detection of defective members of large populations. The Annals of Mathematical Statistics 14(4), 436-440 (1943)
11. Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and its Applications, 2nd edn. Series on Applied Mathematics, vol. 12. World Scientific, Singapore (2000)
12. Feller, W.: An introduction to probability theory and its applications, vol. 1. Wiley, Chichester (1968)
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. 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)
15. Kalai, A.: Efficient pattern-matching with don't cares. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 655-656, Philadelphia, PA, USA, Society for Industrial and Applied Mathematics (2002)
16. Knuth, D.E., Morris, J.H., Pratt, V.B.: Fast pattern matching in strings. SIAM Journal of Computing 6, 323-350 (1977)
17. Kosaraju, S.R.: Efficient string matching. Manuscript (1987)
18. Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theoretical Computer Science 43, 239-249 (1986)
19. Landau, G.M., Vishkin, U.: Efficient string matching in the presence of errors. In: Proc. 26th IEEE FOCS, pp. 126-126. IEEE Computer Society Press, Los Alamitos (1985)