{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:14:13Z","timestamp":1778300053404,"version":"3.51.4"},"reference-count":45,"publisher":"Elsevier BV","issue":"8","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":[[1998,8]]},"DOI":"10.1016\/s0031-3203(97)00124-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T09:11:55Z","timestamp":1027588315000},"page":"1159-1177","source":"Crossref","is-referenced-by-count":20,"title":["A formal theory for optimal and information theoretic syntactic pattern recognition"],"prefix":"10.1016","volume":"31","author":[{"given":"B.J.","family":"Oommen","sequence":"first","affiliation":[]},{"given":"R.L.","family":"Kashyap","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0031-3203(97)00124-6_BIB1","series-title":"Pattern Classification and Scene Analysis","author":"Duda","year":"1973"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB2","series-title":"Introduction to Statistical Pattern Recognition","author":"Fukunaga","year":"1972"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB3","series-title":"Syntactic Methods in Pattern Recognition","author":"Fu","year":"1974"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB4","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1109\/21.362950","article-title":"Parametric string edit distance and its application to pattern recognition","volume":"SMC 25","author":"Bunke","year":"1995","journal-title":"IEEE Trans. Systems Man and Cybernat"},{"issue":"2","key":"10.1016\/S0031-3203(97)00124-6_BIB5","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 -I. Description of the algorithm and its optimality","volume":"23","author":"Kashyap","year":"1981","journal-title":"Inform. Sci"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB6","series-title":"Time Warps,String Edits and Macromolecules","author":"Sankoff","year":"1983"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB7","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1109\/TIT.1975.1055419","article-title":"Decoding with channels with insertions, deletions and substitutions with applications to speech recognition","volume":"IT 21","author":"Bahl","year":"1975","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB8","unstructured":"P. Bucher and K. Hoffmann, A sequence similarity search algorithm based on a probabilistic interpretation of an alignment scoring system, Proc. 4th Int. Conf. on Intelligent Systems for Molecular Biology, Vol. ISMB-96, pp. 44\u201351 (1996)."},{"key":"10.1016\/S0031-3203(97)00124-6_BIB9","series-title":"Handbook of Pattern Recognition and Computer Vision","article-title":"Structural and syntactic pattern recognition","author":"Bunke","year":"1993"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB10","doi-asserted-by":"crossref","unstructured":"M. Y. Chen, A. Kundu and S. Srihari, Handwritten word recognition using morphological segmentation and variable duration\u2014hidden Markov model, Proc. CVPR, June (1993).","DOI":"10.1109\/CVPR.1993.341066"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB11","series-title":"Proc. 3rd Int. Conf. for Intelligent Systems for Molecular Biology","first-page":"114","article-title":"Multiple alignment using hidden Markov models","author":"Eddy","year":"1995"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB12","doi-asserted-by":"crossref","unstructured":"G. D. Forney, The Viterbi algorithm, Proc. IEEE 61 (1973).","DOI":"10.1109\/PROC.1973.9030"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB13","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1006\/jmbi.1994.1104","article-title":"Hidden Markov models in computational biology","volume":"235","author":"Krogh","year":"1994","journal-title":"J. Mol. Biol"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB14","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0031-3203(89)90076-9","article-title":"Recognition of the handwritten word","volume":"22","author":"Kundu","year":"1989","journal-title":"Pattern Recognition"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB15","doi-asserted-by":"crossref","unstructured":"L. R. Rabiner and B.-H. Juang, An introduction to hidden Markov models, IEEE Accoustics Sound Signal Process, 4\u201316 (1986).","DOI":"10.1109\/MASSP.1986.1165342"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB16","doi-asserted-by":"crossref","unstructured":"A. J. Viterbi, Error bounds for convolutional codes and an asymptotically optimal decoding algorithm, IEEE Trans. Inform. Theory 260\u2013266 (1967).","DOI":"10.1109\/TIT.1967.1054010"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB17","series-title":"Relative Frequency of English Speech Sounds","author":"Dewey","year":"1923"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB18","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1145\/356827.356830","article-title":"Approximate string matching","volume":"12","author":"Hall","year":"1980","journal-title":"Comput. Surveys"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB19","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(97)00124-6_BIB20","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 Engng"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB21","doi-asserted-by":"crossref","unstructured":"R. L. Kashyap and B. J. Oommen, String correction using probabilistic methods, Pattern Recognition Lett. 147\u2013154 (1984).","DOI":"10.1016\/0167-8655(84)90038-2"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB22","doi-asserted-by":"crossref","unstructured":"S. B. Needleman and C. D. Wunsch, A general method applicable to the search for similarities in the amino acid sequence of two proteins, J. Mol. Biol. 443\u2013453 (1970).","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB23","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(97)00124-6_BIB24","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 Anal. Mach. Intell"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB25","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":"Inform. Sci"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB26","series-title":"Computer Text Recognition and Error Correction","author":"Srihari","year":"1984"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB27","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(97)00124-6_BIB28","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/321921.321923","article-title":"Bounds for the string editing problem","volume":"23","author":"Wong","year":"1976","journal-title":"J. Assoc. Comput. Mach"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB29","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1137\/0221005","article-title":"A note on the height of suffix trees","volume":"21","author":"Devroye","year":"1992","journal-title":"SIAM J. of Comput"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB30","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1109\/18.133271","article-title":"Analysis of digital tries with Markovian dependencies","volume":"IT 37","author":"Jacquet","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB31","doi-asserted-by":"crossref","unstructured":"D. L. Neuhoff, The Viterbi algorithm as an aid in text recognition, IEEE Trans. Inform. Theory 222\u2013226 (1975).","DOI":"10.1109\/TIT.1975.1055355"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB32","doi-asserted-by":"crossref","unstructured":"W. Szpankowski, Probabilistic analysis of generalized suffix trees, Proc. CPM-92, the 3rd Annual Symp. on Combinatorial Pattern Matching, pp. 1\u201314 (1992).","DOI":"10.1007\/3-540-56024-6_1"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB33","unstructured":"S. H. Levine, S. L. Minneman, C. O. Getschow and C. Goodenough-Trepagnier, Computer disambiguation of multi-character text entry: An adaptive design approach, Proc. IEEE Int. Conf. on Systems, Man and Cybernetics, pp. 298\u2013301 (1986)."},{"key":"10.1016\/S0031-3203(97)00124-6_BIB34","unstructured":"S. L. Minneman, Keyboard optimization technique to improve output rate of disabled individuals, Proc. 9th Annual RESNA Conf. Minneapolis, pp. 402\u2013404 (1986)."},{"key":"10.1016\/S0031-3203(97)00124-6_BIB35","doi-asserted-by":"crossref","unstructured":"R. Shinghal and G. T. Toussaint, Experiments in text recognition with the modified Viterbi algorithm, IEEE Trans. Pattern. Anal. Mach. Intel. pp. 184\u2013192 (1979).","DOI":"10.1109\/TPAMI.1979.4766904"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB36","doi-asserted-by":"crossref","unstructured":"J. Golic and M. Mihaljevic, A noisy clock-controlled shift register cryptanalysis concept based on sequence comparison approach, Proc. EUROCRYPT-90, Aarhus, Denmark, pp. 487\u2013491 (1990).","DOI":"10.1007\/3-540-46877-3_45"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB37","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(97)00124-6_BIB38","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(97)00124-6_BIB39","first-page":"350","article-title":"A fast algorithm for computing longest common subsequences","volume":"20","author":"Hunt","year":"1977","journal-title":"Comm. Assoc. Comput. Mach"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB40","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"Levenshtein","year":"1996","journal-title":"Sov. Phys. Dokl"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB41","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/34.506420","article-title":"The normalized string editing problem revisited","volume":"PAMI 18","author":"Oommen","year":"1996","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB42","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(97)00124-6_BIB43","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(97)00124-6_BIB44","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1073\/pnas.69.1.4","article-title":"Matching sequences under deletion\/insertion constraints","volume":"69","author":"Sankoff","year":"1972","journal-title":"Proc. Nat. Acad. Sci. U.S.A"},{"key":"10.1016\/S0031-3203(97)00124-6_BIB45","series-title":"Non-Uniform Random Variate Generation","author":"Devroye","year":"1986"}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320397001246?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320397001246?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T10:15:38Z","timestamp":1578478538000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320397001246"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":45,"journal-issue":{"issue":"8","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0031320397001246"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(97)00124-6","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}