{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T09:25:46Z","timestamp":1766136346459},"reference-count":31,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Patt. Recogn. Artif. Intell."],"published-print":{"date-parts":[[2012,8]]},"abstract":"<jats:p> We model the edit distance as a function in a labeling space. A labeling space is an Euclidean space where coordinates are the edit costs. Through this model, we define a class of cost. A class of cost is a region in the labeling space that all the edit costs have the same optimal labeling. Moreover, we characterize the distance value through the labeling space. This new point of view of the edit distance gives us the opportunity of defining some interesting properties that are useful for a better understanding of the edit distance. Finally, we show the usefulness of these properties through some applications. <\/jats:p>","DOI":"10.1142\/s021800141260004x","type":"journal-article","created":{"date-parts":[[2012,8,26]],"date-time":"2012-08-26T22:33:43Z","timestamp":1346020423000},"page":"1260004","source":"Crossref","is-referenced-by-count":39,"title":["ON THE GRAPH EDIT DISTANCE COST: PROPERTIES AND APPLICATIONS"],"prefix":"10.1142","volume":"26","author":[{"given":"ALBERT","family":"SOL\u00c9-RIBALTA","sequence":"first","affiliation":[{"name":"Department of Computer Science and Mathematics, Universitat Rovirai Virgili (URV), Avda. Pa\u00efsos Catalans, 26, 43007 Tarragona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"FRANCESC","family":"SERRATOSA","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Mathematics, Universitat Rovirai Virgili (URV), Avda. Pa\u00efsos Catalans, 26, 43007 Tarragona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALBERTO","family":"SANFELIU","sequence":"additional","affiliation":[{"name":"Institut de Rob\u00f2otica i Inform\u00e0tica Industrial CSIC-UPC, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2012,11,26]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00060-3"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1109\/34.790431"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(83)90033-8"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00179-7"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.28"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003228"},{"key":"rf7","first-page":"985","volume":"27","author":"Emms D.","journal-title":"Image Vis. Comput."},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2009.10.013"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1007\/s10044-008-0141-y"},{"key":"rf10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1109\/34.491619"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0019-9"},{"key":"rf13","volume":"37","author":"He L.","journal-title":"Pattern Recogn. Lett."},{"key":"rf15","volume-title":"Handbook of Fingerprint Recognition","author":"Jain A. K.","year":"2003"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2006.152"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1109\/34.954603"},{"key":"rf22","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-008-9184-7"},{"key":"rf23","first-page":"305","volume":"35","author":"Neuhaus M.","journal-title":"IEEE Trans. Syst., Man, Cybern."},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2006.02.013"},{"key":"rf26","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2009.10.011"},{"key":"rf27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02526038"},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.1142\/S021800140900748X"},{"key":"rf30","doi-asserted-by":"publisher","DOI":"10.1016\/j.imavis.2008.04.004"},{"key":"rf33","first-page":"353","volume":"13","author":"Sanfeliu A.","journal-title":"IEEE Trans. Syst., Man, Cybern."},{"key":"rf34","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001404003253"},{"key":"rf36","doi-asserted-by":"publisher","DOI":"10.1016\/S0031-3203(02)00107-3"},{"key":"rf37","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2005.12.005"},{"key":"rf39","first-page":"90","volume":"7","author":"Shapiro L.","journal-title":"Trans. Pattern Anal. Mach. Intell."},{"key":"rf41","doi-asserted-by":"publisher","DOI":"10.1177\/0278364906065387"},{"key":"rf42","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(97)00117-7"},{"key":"rf43","first-page":"599","volume":"7","author":"Wong A.","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["International Journal of Pattern Recognition and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S021800141260004X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T09:11:09Z","timestamp":1565082669000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S021800141260004X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8]]},"references-count":31,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2012,11,26]]},"published-print":{"date-parts":[[2012,8]]}},"alternative-id":["10.1142\/S021800141260004X"],"URL":"https:\/\/doi.org\/10.1142\/s021800141260004x","relation":{},"ISSN":["0218-0014","1793-6381"],"issn-type":[{"value":"0218-0014","type":"print"},{"value":"1793-6381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,8]]}}}