{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:10:33Z","timestamp":1725664233315},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540606970"},{"type":"electronic","value":"9783540492986"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60697-1_94","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T20:54:26Z","timestamp":1330289666000},"page":"116-123","source":"Crossref","is-referenced-by-count":2,"title":["Noisy subsequence recognition using constrained string editing involving substitutions, insertions, deletions and generalized transpositions"],"prefix":"10.1007","author":[{"given":"B. J.","family":"Oommen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. K. S.","family":"Loke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,6]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/356827.356830","volume":"12","author":"P. A. V. Hall","year":"1980","unstructured":"P. A. V. Hall and G. R. Dowling, Approximate string matching, Comput. Surveys, 12:381\u2013402 (1980).","journal-title":"Comput. Surveys"},{"issue":"2","key":"15_CR2","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0255(81)90052-9","volume":"23","author":"R. L. Kashyap","year":"1981","unstructured":"R. L. Kashyap and B. J. Oommen, An effective algorithm for string correction using generalized edit distances-I. Description of the algorithm and its optimality, Inform. Sci., 23(2):123\u2013142 (1981).","journal-title":"Inform. Sci."},{"key":"15_CR3","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1109\/34.232078","volume":"PAMI-15","author":"A. Marzal","year":"1993","unstructured":"A. Marzal and E. Vidal, Computation of normalized edit distance and applications, IEEE Trans. on Pat. Anal. and Mach. Intel., PAMI-15:926\u2013932 (1993).","journal-title":"IEEE Trans. on Pat. Anal. and Mach. Intel."},{"key":"15_CR4","first-page":"707","volume":"10","author":"A. Levenshtein","year":"1966","unstructured":"A. Levenshtein, Binary codes capable of correcting deletions, insertions and reversals, Soviet Phys. Dokl., 10:707\u2013710 (1966).","journal-title":"Soviet Phys. Dokl."},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/321879.321880","volume":"22","author":"R. Lowrancc","year":"1975","unstructured":"R. Lowrancc and R. A. Wagner, An extension of the string to string correction problem, J. Assoc. Comput. Mach., 22:177\u2013183 (1975).","journal-title":"J. Assoc. Comput. Mach."},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/TPAMI.1987.4767962","volume":"PAMI-9","author":"B. J. Oommen","year":"1987","unstructured":"B. J. Oommen, Recognition of noisy subsequences using constrained edit distances, IEEE Trans. on Pat. Anal. and Mach. Intel., PAMI-9:676\u2013685 (1987).","journal-title":"IEEE Trans. on Pat. Anal. and Mach. Intel."},{"key":"15_CR7","unstructured":"B. J. Oommen and R. K. S. Loke, Pattern recognition of strings with substitutions, insertions, deletions and generalized transpositions. Unabridged Paper. Available as a Carleton University technical report (1994)."},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"B. J. Oommen and R. K. S. Loke, Noisy subsequence recognition using constrained string editing involving substitutions, insertions, deletions and generalized transpositions. Unabridged Paper. Available as a Carleton University technical report (1994).","DOI":"10.1007\/3-540-60697-1_94"},{"key":"15_CR9","first-page":"676","volume":"23","author":"J. L. Peterson","year":"1980","unstructured":"J. L. Peterson, Computer programs for detecting and correcting spelling errors, Comm. Assoc. Comput. Mach., 23:676\u2013687 (1980).","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"15_CR10","unstructured":"D. Sankoff and J. B. Kruskal, Time Warps,String Edits and Macromolecules: The Theory and practice of Sequence Comparison, Addison-Wesley (1983)."},{"key":"15_CR11","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R. A. Wagner","year":"1974","unstructured":"R. A. Wagner and M. J. Fischer, The string to string correction problem, J. Assoc. Comput. Mach., 21:168\u2013173 (1974).","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Lecture Notes in Computer Science","Image Analysis Applications and Computer Graphics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60697-1_94.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:01:47Z","timestamp":1605646907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60697-1_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540606970","9783540492986"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-60697-1_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}