{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T04:04:14Z","timestamp":1777089854828,"version":"3.51.4"},"reference-count":18,"publisher":"Elsevier BV","issue":"9-10","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"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 Letters"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0167-8655(02)00382-3","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T19:16:29Z","timestamp":1048619789000},"page":"1417-1426","source":"Crossref","is-referenced-by-count":30,"title":["Comparison of AESA and LAESA search algorithms using string and tree-edit-distances"],"prefix":"10.1016","volume":"24","author":[{"given":"Juan Ram\u00f3n","family":"Rico-Juan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luisa","family":"Mic\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-8655(02)00382-3_BIB1","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1016\/0167-8655(95)00121-V","article-title":"A note on the Nagendraprasad\u2013Wang\u2013Gupta thinning algorithm","volume":"16","author":"Carrasco","year":"1995","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(02)00382-3_BIB2","series-title":"Pattern Recognition and Scene Analysis","author":"Duda","year":"1973"},{"key":"10.1016\/S0167-8655(02)00382-3_BIB3","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TEC.1961.5219197","article-title":"On the encoding of arbitrary geometric configurations","volume":"10","author":"Freeman","year":"1961","journal-title":"IRE Trans. Electron. Comput."},{"key":"10.1016\/S0167-8655(02)00382-3_BIB4","unstructured":"G\u00f3mez, E., Mic\u00f3, L., Oncina, J., 1995. Testing the linear approximating eliminating search algorithm in handwritten character recognition tasks. In: Actas del VI Simposium Nacional de Reconocimiento de Formas y An\u00e1lisis de Im\u00e1genes. C\u00f3rdoba, Spain, pp. 212\u2013217"},{"key":"10.1016\/S0167-8655(02)00382-3_BIB5","doi-asserted-by":"crossref","unstructured":"Juan, A., Vidal, E., 2000. On the use of edit distances and an efficient k-NN search technique (k-AESA) for fast and accurate string classification. In: Proc. of the 15th Internat. Conf. Pattern Recognition (ICPR 2000), Spain, Vol. 2. pp. 680\u2013683","DOI":"10.1109\/ICPR.2000.906165"},{"key":"10.1016\/S0167-8655(02)00382-3_BIB6","doi-asserted-by":"crossref","unstructured":"L\u00f3pez, D., Pi\u00f1aga, I., 2000. Syntactic pattern recognition by error correcting analysis on tree automata. In: Ferri, F.J., I\u00f1esta, J.M., Amin, A., Pudil, P. (Eds.), Advances in Pattern Recognition. Lecture Notes in Computer Science, Vol. 1876. Springer-Verlag, Berlin, pp. 133\u2013142","DOI":"10.1007\/3-540-44522-6_14"},{"key":"10.1016\/S0167-8655(02)00382-3_BIB7","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0022-0000(80)90002-1","article-title":"A faster algorithm for computing string edit distances","volume":"20","author":"Masek","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0167-8655(02)00382-3_BIB8","unstructured":"Mic\u00f3, L., 1996. Algoritmos de b\u00fasqueda de vecinos m\u00e1s pr\u00f3ximos en espacios m\u00e9tricos. Ph.D. thesis, Universidad Polit\u00e9cnica de Valencia, Departamento de Sistemas Inform\u00e1ticos y Computaci\u00f3n"},{"key":"10.1016\/S0167-8655(02)00382-3_BIB9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1016\/S0167-8655(98)00007-5","article-title":"Comparison of fast nearest neighbour classifiers for handwritten character recognition","volume":"19","author":"Mic\u00f3","year":"1998","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(02)00382-3_BIB10","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/0167-8655(94)90095-7","article-title":"A new version of the nearest-neighbour approximating and eliminating search algorithm with linear preprocessing-time and memory requirements","volume":"15","author":"Mico","year":"1994","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(02)00382-3_BIB11","unstructured":"Rico-Juan, J.R., 1999. Off-line cursive handwritten word recognition based on tree extraction and an optimized classification distance. In: Torres, M.I., Sanfeliu, A. (Eds.), Pattern Recognition and Image Analysis: Proc. VII Symp. Nacional de Reconocimiento de Formas y An\u00e1lisis de Im\u00e1genes, Bilbao, Spain, Vol. 3, pp. 15\u201316"},{"key":"10.1016\/S0167-8655(02)00382-3_BIB12","unstructured":"Rico-Juan, J.R., Calera-Rubio, J., 2002. Evaluation of handwritten character recognizers using tree-edit-distance and fast nearest neighbour search. In: I\u00f1esta, J.M., Mic\u00f3, L. (Eds.), Pattern Recognition in Inform. Systems, Alicante, Spain. ICEIS PRESS, pp. 326\u2013335"},{"issue":"1","key":"10.1016\/S0167-8655(02)00382-3_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8655(94)90094-9","article-title":"New formulation and improvements of the nearest-neighbour approximating and eliminating search algorithm (AESA)","volume":"15","author":"Vidal","year":"1994","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0167-8655(02)00382-3_BIB14","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0167-6393(85)90058-5","article-title":"Is the DTW distance really a metric? An algorithm reducing the number of dtw comparisons in isolated words","volume":"4","author":"Vidal","year":"1985","journal-title":"Speech Comm."},{"key":"10.1016\/S0167-8655(02)00382-3_BIB15","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0167-6393(88)90059-3","article-title":"Fast speaker independent DTW recognition of isolated words using a metric-space search algorithm (AESA)","volume":"7","author":"Vidal","year":"1988","journal-title":"Speech Comm."},{"key":"10.1016\/S0167-8655(02)00382-3_BIB16","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1109\/29.1575","article-title":"On the use of a metric-space search algorithm (AESA) for fast DTW-bassed recognition of isolated words","volume":"36","author":"Vidal","year":"1988","journal-title":"IEEE Trans. Acoust., Speech, Signal Process."},{"key":"10.1016\/S0167-8655(02)00382-3_BIB17","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. ACM"},{"key":"10.1016\/S0167-8655(02)00382-3_BIB18","doi-asserted-by":"crossref","first-page":"1245","DOI":"10.1137\/0218082","article-title":"Simple fast algorithms for the editing distance between trees and related problems","volume":"18","author":"Zhang","year":"1989","journal-title":"SIAM J. Comput."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865502003823?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167865502003823?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,11]],"date-time":"2020-03-11T22:42:13Z","timestamp":1583966533000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167865502003823"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":18,"journal-issue":{"issue":"9-10","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0167865502003823"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8655(02)00382-3","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}