A filtering algorithm for k-mismatch with don't cares

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

Volumn 4726 LNCS, Issue , 2007, Pages 130-136

  Clifford, Raphaël ^a   Porat, Ely ^b  

^a UNIVERSITY OF BRISTOL   (United Kingdom)

^b BAR ILAN UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COST EFFECTIVENESS; PROBLEM SOLVING;

FILTERING BASED ALGORITHMS; MISMATCHES;

PATTERN MATCHING;

EID: 38049061764     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75530-2_12     Document Type: Conference Paper

References (15)

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. Clifford, P., Clifford, R.: Simple deterministic wildcard matching. Information Processing Letters 101(2), 53-54 (2007)
6. 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)
7. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
8. Durbin, R., Eddy, S.R., Krogh, A., Mitchison, C.: Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acids. Cambridge University Press, Cambridge (1999)
9. 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)
10. 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)
11. 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)
12. Knuth, D.E., Morris, J.H., Pratt, V.B.: Fast pattern matching in strings. SIAM Journal of Computing 6, 323-350 (1977)
13. Kosaraju, S.R.: Efficient string matching. Manuscript (1987)
14. Landau, G.M., Vishkin, U.: Efficient string matching with k mismatches. Theoretical Computer Science 43, 239-249 (1986)
15. Landau, G.M., Vishkin, U.: Efficient string matching in the presence of errors. In: Proc. 26th IEEE FOCS, p. 126 (1985)