{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:50:20Z","timestamp":1752360620017},"reference-count":23,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Recognition"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1016\/s0031-3203(96)00101-x","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T02:45:35Z","timestamp":1049510735000},"page":"789-800","source":"Crossref","is-referenced-by-count":23,"title":["Pattern recognition of strings with substitutions, insertions, deletions and generalized transpositions"],"prefix":"10.1016","volume":"30","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":"78","reference":[{"key":"10.1016\/S0031-3203(96)00101-X_BIB1","first-page":"926","article-title":"Computation of normalized edit distance and applications","author":"Marzal","year":"1993"},{"key":"10.1016\/S0031-3203(96)00101-X_BIB2","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/356827.356830","article-title":"Approximate string matching","volume":"12","author":"Hall","journal-title":"Comput. Surveys"},{"key":"10.1016\/S0031-3203(96)00101-X_BIB3","first-page":"676","article-title":"Computer programs for detecting and correcting spelling errors","volume":"23","author":"Peterson","year":"1980","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB4","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Soviet Phys. Dokl."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB5","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1109\/TC.1976.5009232","article-title":"A method of correction of garbled words based on the Levenshtein metric","volume":"C-25","author":"Okuda","year":"1976","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB6","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","article-title":"The string to string correction problem","volume":"21","author":"Wagner","year":"1974","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB7","series-title":"Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison","author":"Sankoff","year":"1983"},{"key":"10.1016\/S0031-3203(96)00101-X_BIB8","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","article-title":"A faster algorithm computing string edit distances","volume":"20","author":"Masek","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB9","first-page":"341","article-title":"A linear space algorithm for computing maximal common subsequences","volume":"18","author":"Hirschberg","year":"1975","journal-title":"Comm. Assoc. Comput. Mach."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB10","doi-asserted-by":"crossref","first-page":"664","DOI":"10.1145\/322033.322044","article-title":"Algorithms for longest common subsequence problem","volume":"24","author":"Hirschberg","year":"1977","journal-title":"J Assoc. Comput. Mach."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB11","first-page":"350","volume":"20","author":"Hunt","year":"1977","journal-title":"A fast algorithm for computing longest common subsequences Comm. Assoc. Comput. Mach."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/321921.321922","article-title":"Bounds on the complexity of the longest common subsequence problem","volume":"23","author":"Aho","year":"1976","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB13","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1109\/TSE.1983.237018","article-title":"The noisy substring matching problem","volume":"SE-9","author":"Kashyap","year":"1983","journal-title":"IEEE Trans. Software Eng."},{"issue":"2","key":"10.1016\/S0031-3203(96)00101-X_BIB14","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0255(81)90052-9","article-title":"An effective algorithm for string correction using generalized edit distances\u2014I. Description of the algorithm and its optimality","volume":"23","author":"Kashyap","year":"1981","journal-title":"Inf. Sci."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0167-8655(84)90038-2","article-title":"String correction using probabilistic methods","author":"Kashyap","year":"1984","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB16","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/321879.321880","article-title":"An extension of the string to string correction problem","volume":"22","author":"Lowrance","year":"1975","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1080\/00207168308803349","article-title":"A common basis for similarity and dissimilarity measures involving two strings","volume":"13","author":"Kashyap","year":"1983","journal-title":"Int. J. Comput. Math."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0255(94)00110-W","article-title":"String alignment with substitution, insertion, deletion, squashing and expansion operations","volume":"77","author":"Oommen","year":"1995","journal-title":"Inf. Sci."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB19","first-page":"319","article-title":"A lower bound for the edit distance problem under an arbitrary cost function","volume":"27","author":"Huang","year":"1988"},{"key":"10.1016\/S0031-3203(96)00101-X_BIB20","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/TPAMI.1987.4767962","article-title":"Recognition of noisy subsequences using constrained edit distances","volume":"PAMI-9","author":"Oommen","year":"1987","journal-title":"IEEE Trans. Pattern Analysis Mach. Intell."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB21","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","article-title":"Algorithms for approximate string matching","volume":"64","author":"Ukkonen","year":"1985","journal-title":"Inf. Cont."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB22","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1016\/0020-0255(86)90061-7","article-title":"Constrained string editing","volume":"40","author":"Oommen","year":"1987","journal-title":"Inf. Sci."},{"key":"10.1016\/S0031-3203(96)00101-X_BIB23","series-title":"Proc. 1993 Int. Symp. on Comp. and Inform. Sci.","first-page":"492","article-title":"Symbolic channel modelling for noisy channels which permit arbitrary noise distributions","author":"Oommen","year":"1993"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S003132039600101X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S003132039600101X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:23:38Z","timestamp":1556385818000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S003132039600101X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["S003132039600101X"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(96)00101-x","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}