{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,13]],"date-time":"2023-01-13T02:10:20Z","timestamp":1673575820250},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2006,8,26]],"date-time":"2006-08-26T00:00:00Z","timestamp":1156550400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Pattern Anal Applic"],"published-print":{"date-parts":[[2006,9,26]]},"DOI":"10.1007\/s10044-006-0036-8","type":"journal-article","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T17:40:52Z","timestamp":1156527652000},"page":"177-187","source":"Crossref","is-referenced-by-count":3,"title":["A novel look-ahead optimization strategy for trie-based approximate string matching"],"prefix":"10.1007","volume":"9","author":[{"given":"Ghada","family":"Badr","sequence":"first","affiliation":[]},{"given":"B. John","family":"Oommen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,8,26]]},"reference":[{"key":"36_CR1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/S0022-2836(05)80360-2","volume":"215","author":"SF Altschul","year":"1990","unstructured":"Altschul SF, Gish W, Miller W, Myers EW, Lipman DJ (1990) A basic local alignment search tool. J Mol Biol 215:403\u2013410","journal-title":"J Mol Biol"},{"key":"36_CR2","unstructured":"Baeza-Yates RA, Gonnet GH (1982) A new approach to text searching. In: Annual ACM-SIGIR conference on information retrieval, Cambridge, MA, June 1982, pp 168\u2013175"},{"key":"36_CR3","unstructured":"Bentley J, Sedgewick R (1997) Fast algorithms for sorting and searching strings. In: Eighth annual ACM-SIAM symposium on discrete algorithms, New Orleans, January 1997, pp 360\u2013369"},{"key":"36_CR4","unstructured":"Bucher P, Hoffmann K (1996) A sequence similarity search algorithm based on a probabilistic interpretation of an alignment scoring system. In: Proceedings of the fourth international conference on intelligent systems for molecular biology, ISMB, vol 96, pp 44\u201351"},{"key":"36_CR5","volume-title":"Handbook of pattern recognition and computer vision","author":"H Bunke","year":"1993","unstructured":"Bunke H (1993) Structural and syntactic pattern recognition. In: Chen CH, Pau LF, Wang PSP (eds) Handbook of pattern recognition and computer vision. World Scientific, Singapore"},{"issue":"1","key":"36_CR6","doi-asserted-by":"crossref","first-page":"202","DOI":"10.1109\/21.362950","volume":"SMC-25","author":"H Bunke","year":"1993","unstructured":"Bunke H, Csirik J (1993) Parametric string edit distance and its application to pattern recognition. IEEE Trans Syst Man Cybern SMC-25(1):202\u2013206","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"36_CR7","unstructured":"Chang W, Lawler E (1992) Approximate string matching in sublinear expected time. In: 13th annual symposium on foundations of computer science, St.~Louis, Missouri, October 1992. IEEE Computer Society Press, pp 116\u2013124"},{"key":"36_CR8","unstructured":"Clement J, Flajolet P, Vallee B (1998) The analysis of hybrid trie structures. In: Proceedings of the annual ACM\u2013SIAM symposium on discrete algorithms, San Francisco, CA, pp 531\u2013539"},{"issue":"6","key":"36_CR9","doi-asserted-by":"crossref","first-page":"1654","DOI":"10.1137\/S0097539702402007","volume":"32","author":"M Crochemore","year":"1973","unstructured":"Crochemore M, Landau GM, Ziv-Ukleson M (1973) A subquadratic sequence alignment algorithm for unrestricted scoring matrices. SIAM J 32(6):1654\u20131673","journal-title":"SIAM J"},{"key":"36_CR10","doi-asserted-by":"crossref","DOI":"10.4159\/harvard.9780674419193","volume-title":"Relative frequency of English speech sounds","author":"G Dewey","year":"1923","unstructured":"Dewey G (1923) Relative frequency of English speech sounds. Harvard University Press, Cambridge, MA"},{"issue":"4","key":"36_CR11","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1109\/69.298177","volume":"6","author":"M Du","year":"1994","unstructured":"Du M, Chang S (1994) An approach to designing very fast approximate string matching algorithms. IEEE Trans Knowledge Data Eng 6(4):620\u2013633","journal-title":"IEEE Trans Knowledge Data Eng"},{"key":"36_CR12","volume-title":"Artificial intelligence: a knowledge-based approach","author":"M Firebaugh","year":"1988","unstructured":"Firebaugh M (1988) Artificial intelligence: a knowledge-based approach. Boyd and Fraser, Boston"},{"issue":"6","key":"36_CR13","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1145\/360825.360861","volume":"18","author":"DS Hirschberg","year":"1975","unstructured":"Hirschberg DS (1975) A linear space algorithm for computing maximal common subsequence. Commun ACM 18(6):341\u2013343","journal-title":"Commun ACM"},{"key":"36_CR14","first-page":"350","volume":"20","author":"JW Hunt","year":"1977","unstructured":"Hunt JW, Szymanski TG (1977) A fast algorithm for computing longest common subsequences. Commun Assoc Comput Mach 20:350\u2013353","journal-title":"Commun Assoc Comput Mach"},{"issue":"2","key":"36_CR15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0255(81)90052-9","volume":"23","author":"RL Kashyap","year":"1981","unstructured":"Kashyap RL, Oommen BJ (1981) An effective algorithm for string correction using generalized edit distances -I: description of the algorithm and its optimality. Inf Sci 23(2):123\u2013142","journal-title":"Inf Sci"},{"key":"36_CR16","first-page":"707","volume":"10","author":"A Levenshtein","year":"1966","unstructured":"Levenshtein A (1966) Binary codes capable of correcting deletions, insertions and reversals. Sov Phys Dokl 10:707\u2013710","journal-title":"Sov Phys Dokl"},{"key":"36_CR17","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","volume":"20","author":"WJ Masek","year":"1980","unstructured":"Masek WJ, Paterson MS (1980) A faster algorithm computing string edit distances. J Comput Syst Sci 20:18\u201331","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"36_CR18","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G Navarro","year":"2001","unstructured":"Navarro G (2001) A guided tour to approximate string matching. ACM Comput Surv 33(1):31\u201388","journal-title":"ACM Comput Surv"},{"issue":"1","key":"36_CR19","first-page":"73","volume":"22","author":"K Oflazer","year":"1996","unstructured":"Oflazer K (1996) Error-tolerant finite state recognition with applications to morphological analysis and spelling correction. Comput Linguist 22(1):73\u201389","journal-title":"Computat Linguist"},{"key":"36_CR20","doi-asserted-by":"crossref","first-page":"676","DOI":"10.1109\/TPAMI.1987.4767962","volume":"9","author":"BJ Oommen","year":"1987","unstructured":"Oommen BJ (1987) Recognition of noisy subsequences using constrained edit distances. IEEE Trans Pattern Anal Mach Intel PAMI 9:676\u2013685","journal-title":"IEEE Trans Pattern Anal Mach Intel PAMI"},{"key":"36_CR21","doi-asserted-by":"crossref","unstructured":"Oommen BJ, Badr G (2004) Dictionary-based syntactic pattern recognition using tries. In: Proceedings of the joint IARR international workshops SSPR 2004 and SPR 2004, Libon, August 2004","DOI":"10.1007\/978-3-540-27868-9_26"},{"key":"36_CR22","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1016\/S0031-3203(97)00124-6","volume":"31","author":"BJ Oommen","year":"1998","unstructured":"Oommen BJ, Kashyap RL (1998) A formal theory for optimal and information theoretic syntactic pattern recognition. Pattern Recognit 31:1159\u20131177","journal-title":"Pattern Recognit"},{"key":"36_CR23","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1109\/3477.809040","volume":"SMC-29","author":"BJ Oommen","year":"1999","unstructured":"Oommen BJ, Loke RKS (1999) Designing syntactic pattern classifiers using vector quantization and parametric string editing. IEEE Trans Syst Man Cybern SMC-29:881-888","journal-title":"IEEE Trans Syst Man Cybern"},{"key":"36_CR24","unstructured":"Oommen BJ, Loke RKS (2006) Syntactic pattern recognition involving traditional and generalized transposition errors: attaining the information theoretic bound (submitted)"},{"key":"36_CR25","first-page":"676","volume":"23","author":"JL Peterson","year":"1980","unstructured":"Peterson JL (1980) Computer programs for detecting and correcting spelling errors. Commun Assoc Comput Mach 23:676\u2013687","journal-title":"Commun Assoc Comput Mach"},{"key":"36_CR26","volume-title":"Time warps, string edits and macromolecules: the theory and practice of sequence comparison","author":"D Sankoff","year":"1983","unstructured":"Sankoff D, Kruskal JB (1983) Time warps, string edits and macromolecules: the theory and practice of sequence comparison. Addison\u2013Wesley, Reading, MA"},{"issue":"4","key":"36_CR27","doi-asserted-by":"crossref","first-page":"540","DOI":"10.1109\/69.536247","volume":"8","author":"H Shang","year":"1996","unstructured":"Shang H, Merrettal T (1996) Tries for approximate string matching. IEEE Trans Knowledge Data Eng 8(4):540\u2013547","journal-title":"IEEE Trans Knowledge Data Eng"},{"key":"36_CR28","unstructured":"Stephen GA (2000) String searching algorithms, Lecture notes series on computing, vol 6, World Scientific, Sihgapore, NJ"},{"key":"36_CR29","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/S0019-9958(85)80046-2","volume":"64","author":"E Ukkonen","year":"1985","unstructured":"Ukkonen E (1985) Algorithm for approximate string matching. Inf control 64:100\u2013118","journal-title":"Inf control"},{"key":"36_CR30","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1145\/360980.360995","volume":"17","author":"RA Wagner","year":"1974","unstructured":"Wagner RA (1974) Order-n correction for regular languages. Commun ACM 17:265\u2013268","journal-title":"Commun ACM"},{"key":"36_CR31","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1145\/321796.321811","volume":"21","author":"R Wagner","year":"1974","unstructured":"Wagner R, Fischer A (1974) The string-to-string correction problem. J Assoc Comput Machinery (ACM) 21:168\u2013173","journal-title":"J Assoc Comput Machinery (ACM)"},{"issue":"10","key":"36_CR32","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1145\/135239.135244","volume":"35","author":"S Wu","year":"1992","unstructured":"Wu S, Manber U (1992) Fast text searching allowing errors. Commmun ACM 35(10):83\u201391","journal-title":"Commmun ACM"}],"container-title":["Pattern Analysis and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-006-0036-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10044-006-0036-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10044-006-0036-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:02:25Z","timestamp":1559116945000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10044-006-0036-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8,26]]},"references-count":32,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2006,9,26]]}},"alternative-id":["36"],"URL":"https:\/\/doi.org\/10.1007\/s10044-006-0036-8","relation":{},"ISSN":["1433-7541","1433-755X"],"issn-type":[{"value":"1433-7541","type":"print"},{"value":"1433-755X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8,26]]}}}