Self-normalised distance with don't cares

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

Volumn 4580 LNCS, Issue , 2007, Pages 63-70

  Clifford, Peter ^a   Clifford, Raphaël ^b  

^a UNIVERSITY OF OXFORD   (United Kingdom)

^b UNIVERSITY OF BRISTOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; PATTERN MATCHING; PROBLEM SOLVING;

SELF-NORMALISED DISTANCE; SHIFT-SCALE VERSION;

DISTANCE MEASUREMENT;

EID: 37849014961     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-73437-6_9     Document Type: Conference Paper

References (17)

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. 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)
5. Clifford, P., Clifford, R.: Simple deterministic wildcard matching. Information Processing Letters 101(2), 53-54 (2007)
6. 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)
7. Clifford, R., Iliopoulos, C.: String algorithms in music analysis. Soft Computing 8(9), 597-603 (2004)
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 (2002)
9. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)
10. 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)
11. 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)
12. Jain, R., Kasturi, R., Schunck, B.G.: Machine Vision. McGraw-Hill, New York (1995)
13. 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 (2002)
14. Kosaraju, S.R.: Efficient string matching. Manuscript (1987)
15. Lewis, J.P.: Fast template matching. In: Vision Interface, pp. 120-123 (1995)
16. ∞ metric. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol. 3772, pp. 91-103. Springer, Heidelberg (2005)
17. Mäkinen, V., Navarro, G., Ukkonen, E.: Transposition invariant string matching. Journal of Algorithms 56(2), 124-153 (2005)