{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:36:05Z","timestamp":1725489365184},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540734369"},{"type":"electronic","value":"9783540734376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73437-6_9","type":"book-chapter","created":{"date-parts":[[2007,8,13]],"date-time":"2007-08-13T13:36:44Z","timestamp":1187012204000},"page":"63-70","source":"Crossref","is-referenced-by-count":6,"title":["Self-normalised Distance with Don\u2019t Cares"],"prefix":"10.1007","author":[{"given":"Peter","family":"Clifford","sequence":"first","affiliation":[]},{"given":"Rapha\u00ebl","family":"Clifford","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1137\/0216067","volume":"16","author":"K. Abrahamson","year":"1987","unstructured":"Abrahamson, K.: Generalized string matching. SIAM journal on Computing\u00a016(6), 1039\u20131051 (1987)","journal-title":"SIAM journal on Computing"},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1995.1047","volume":"118","author":"A. Amir","year":"1995","unstructured":"Amir, A., Farach, M.: Efficient 2-dimensional approximate matching of half-rectangular figures. Information and Computation\u00a0118(1), 1\u201311 (1995)","journal-title":"Information and Computation"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/11496656_9","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"2005","unstructured":"Amir, A., Lipsky, O., Porat, E., Umanski, J.: Approximate matching in the L\n                  1 metric. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 91\u2013103. Springer, Heidelberg (2005)"},{"issue":"4","key":"9_CR4","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1109\/83.913600","volume":"10","author":"M.J. Atallah","year":"2001","unstructured":"Atallah, M.J.: Faster image template matching in the sum of the absolute value of differences measure. IEEE Transactions on Image Processing\u00a010(4), 659\u2013663 (2001)","journal-title":"IEEE Transactions on Image Processing"},{"issue":"2","key":"9_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.ipl.2006.08.002","volume":"101","author":"P. Clifford","year":"2007","unstructured":"Clifford, P., Clifford, R.: Simple deterministic wildcard matching. Information Processing Letters\u00a0101(2), 53\u201354 (2007)","journal-title":"Information Processing Letters"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/11496656_7","volume-title":"Combinatorial Pattern Matching","author":"P. Clifford","year":"2005","unstructured":"Clifford, P., Clifford, R., Iliopoulos, C.S.: Faster algorithms for \u03b4,\u03b3-matching and related problems. In: Apostolico, A., Crochemore, M., Park, K. (eds.) CPM 2005. LNCS, vol.\u00a03537, pp. 68\u201378. Springer, Heidelberg (2005)"},{"issue":"9","key":"9_CR7","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s00500-004-0384-5","volume":"8","author":"R. Clifford","year":"2004","unstructured":"Clifford, R., Iliopoulos, C.: String algorithms in music analysis. Soft Computing\u00a08(9), 597\u2013603 (2004)","journal-title":"Soft Computing"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"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\u2013601 (2002)","DOI":"10.1145\/509907.509992"},{"key":"9_CR9","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"9_CR10","unstructured":"Fischer, M., Paterson, M.: String matching and other products. In: Karp, R. (ed.) Proceedings of the 7th SIAM-AMS Complexity of Computation, pp. 113\u2013125 (1974)"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013173 (1998)","DOI":"10.1109\/SFCS.1998.743440"},{"key":"9_CR12","volume-title":"Machine Vision","author":"R. Jain","year":"1995","unstructured":"Jain, R., Kasturi, R., Schunck, B.G.: Machine Vision. McGraw-Hill, New York (1995)"},{"key":"9_CR13","unstructured":"Kalai, A.: Efficient pattern-matching with don\u2019t cares. In: Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 655\u2013656, Philadelphia, PA, USA (2002)"},{"key":"9_CR14","unstructured":"Kosaraju, S.R.: Efficient string matching. Manuscript (1987)"},{"key":"9_CR15","unstructured":"Lewis, J.P.: Fast template matching. In: Vision Interface, pp. 120\u2013123 (1995)"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","first-page":"91","volume-title":"String Processing and Information Retrieval","author":"O. Lipsky","year":"2005","unstructured":"Lipsky, O., Porat, E.: Approximate matching in the l\n                  \u2009\u221e\u2009 metric. In: Consens, M.P., Navarro, G. (eds.) SPIRE 2005. LNCS, vol.\u00a03772, pp. 91\u2013103. Springer, Heidelberg (2005)"},{"issue":"2","key":"9_CR17","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1016\/j.jalgor.2004.07.008","volume":"56","author":"V. M\u00e4kinen","year":"2005","unstructured":"M\u00e4kinen, V., Navarro, G., Ukkonen, E.: Transposition invariant string matching. Journal of Algorithms\u00a056(2), 124\u2013153 (2005)","journal-title":"Journal of Algorithms"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73437-6_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:12:16Z","timestamp":1619503936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73437-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540734369","9783540734376"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73437-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}