{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:37:14Z","timestamp":1725550634483},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540297406"},{"type":"electronic","value":"9783540322412"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11575832_37","type":"book-chapter","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T10:12:50Z","timestamp":1129198370000},"page":"331-334","source":"Crossref","is-referenced-by-count":2,"title":["Approximate Matching in the L \u2009\u221e\u2009 Metric"],"prefix":"10.1007","author":[{"given":"Ohad","family":"Lipsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ely","family":"Porat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Amir, A., Lipsky, O., Porat, E., Umanski, J.: Approximate matching in the l1 metric. In: Apostolico, et al. (eds.) [2], pp. 91\u2013103 (2005)","DOI":"10.1007\/11496656_9"},{"key":"37_CR2","series-title":"Lecture Notes in Computer Science","volume-title":"Combinatorial Pattern Matching","year":"2005","unstructured":"Apostolico, A., Crochemore, M., Park, K. (eds.): CPM 2005. LNCS, vol.\u00a03537. Springer, Heidelberg (2005)"},{"volume-title":"Combinatorial Algorithms on Words","year":"1985","key":"37_CR3","unstructured":"Apostolico, A., Galil, Z. (eds.): Combinatorial Algorithms on Words. Springer, New York (1985)"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Clifford, P., Clifford, R., Iliopoulos, C.S.: Faster algorithms for delta, gamma-matching and related problems. In: Apostolico, A., et al. (eds.) [2], pp. 68\u201378 (2005)","DOI":"10.1007\/11496656_7"},{"key":"37_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"782","DOI":"10.1007\/978-3-540-27836-8_66","volume-title":"Automata, Languages and Programming","author":"P. Indyk","year":"2004","unstructured":"Indyk, P., Lewenstein, M., Lipsky, O., Porat, E.: Closest pair problems in very high dimensions. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 782\u2013792. Springer, Heidelberg (2004)"},{"key":"37_CR6","unstructured":"Indyk, P., Lipsky, O., Porat, E.: Approximate translation matching (2004) (manuscript)"},{"key":"37_CR7","unstructured":"Lipsky, O.: Efficient distance computations. Master\u2019s thesis, Bar-Ilan University, Department of Computer Science (2003)"},{"key":"37_CR8","unstructured":"Lipsky, O., Porat, E.: Approximate l\u2009\u221e\u2009 matching. Technical report, Department of Computer Science (2003)"},{"key":"37_CR9","unstructured":"Shmulevich, I., Yli-Harja, O., Coyle, E., Povel, D., Lemstrom, K.: Perceptual issues in music pattern recognition - complexity of rhythm and key fining (1999)"}],"container-title":["Lecture Notes in Computer Science","String Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11575832_37.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:58:05Z","timestamp":1605625085000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11575832_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540297406","9783540322412"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11575832_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}