{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T10:51:47Z","timestamp":1725533507984},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642024405"},{"type":"electronic","value":"9783642024412"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02441-2_13","type":"book-chapter","created":{"date-parts":[[2009,6,17]],"date-time":"2009-06-17T13:19:32Z","timestamp":1245244772000},"page":"142-153","source":"Crossref","is-referenced-by-count":1,"title":["Online Approximate Matching with Non-local Distances"],"prefix":"10.1007","author":[{"given":"Rapha\u00ebl","family":"Clifford","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Sach","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Amir, A., Aumann, Y., Benson, G., Levy, A., Lipsky, O., Porat, E., Skiena, S., Vishne, U.: Pattern matching with address errors: rearrangement distances. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 1221\u20131229 (2006)","DOI":"10.1145\/1109557.1109692"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-69068-9_13","volume-title":"Combinatorial Pattern Matching","author":"A. Amir","year":"2008","unstructured":"Amir, A., Aumann, Y., Kapah, O., Levy, A., Porat, E.: Approximate string matching with address bit errors. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 118\u2013129. Springer, Heidelberg (2008)"},{"issue":"5","key":"13_CR3","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1137\/S0097539702424496","volume":"35","author":"A. Amir","year":"2006","unstructured":"Amir, A., Aumann, Y., Lewenstein, M., Porat, E.: Function matching. SIAM Journal on Computing\u00a035(5), 1007\u20131022 (2006)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0890-5401(02)00035-4","volume":"181","author":"A. Amir","year":"2003","unstructured":"Amir, A., Cole, R., Hariharan, R., Lewenstein, M., Porat, E.: Overlap matching. Inf. Comput.\u00a0181(1), 57\u201374 (2003)","journal-title":"Inf. Comput."},{"issue":"1","key":"13_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00453-005-1192-8","volume":"45","author":"A. Amir","year":"2006","unstructured":"Amir, A., Eisenberg, E., Porat, E.: Swap and mismatch edit distance. Algorithmica\u00a045(1), 109\u2013120 (2006)","journal-title":"Algorithmica"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0020-0190(94)90086-8","volume":"49","author":"A. Amir","year":"1994","unstructured":"Amir, A., Farach, M., Muthukrishnan, S.: Alphabet dependence in parameterized matching. Inf. Process. Lett.\u00a049(3), 111\u2013115 (1994)","journal-title":"Inf. Process. Lett."},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-540-73437-6_9","volume-title":"Combinatorial Pattern Matching","author":"P. Clifford","year":"2007","unstructured":"Clifford, P., Clifford, R.: Self-normalised distance with don\u2019t cares. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol.\u00a04580, pp. 63\u201370. Springer, Heidelberg (2007)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-540-69068-9_15","volume-title":"Combinatorial Pattern Matching","author":"R. Clifford","year":"2008","unstructured":"Clifford, R., Efremenko, K., Porat, B., Porat, E.: A black box for online approximate pattern matching. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol.\u00a05029, pp. 143\u2013151. Springer, Heidelberg (2008)"},{"issue":"1","key":"13_CR9","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1145\/322234.322244","volume":"28","author":"Z. Galil","year":"1981","unstructured":"Galil, Z.: String matching in real time. Journal of the ACM\u00a028(1), 134\u2013149 (1981)","journal-title":"Journal of the ACM"},{"issue":"1","key":"13_CR10","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0022-0000(88)90045-1","volume":"37","author":"G.M. Landau","year":"1988","unstructured":"Landau, G.M., Vishkin, U.: Fast string matching with k differences. J. Comput. Syst. Sci.\u00a037(1), 63\u201378 (1988)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR11","unstructured":"Levenshtein, I.V.: Binary codes capable of correcting deletions, insertions, and reversals. Cybernetics and Control Theory (1966)"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"W.J. Masek","year":"1980","unstructured":"Masek, W.J., Paterson, M.: A faster algorithm computing string edit distances. J. Comput. Syst. Sci.\u00a020(1), 18\u201331 (1980)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Pattern Matching"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02441-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T20:42:35Z","timestamp":1552077755000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02441-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642024405","9783642024412"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02441-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}