{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T13:27:57Z","timestamp":1730294877176,"version":"3.28.0"},"reference-count":30,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,11]]},"DOI":"10.1109\/sccc49216.2019.8966441","type":"proceedings-article","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T02:58:56Z","timestamp":1579834736000},"page":"1-5","source":"Crossref","is-referenced-by-count":3,"title":["Pivot Selection for Median String Problem"],"prefix":"10.1109","author":[{"given":"Pedro","family":"Mirabal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jose","family":"Abreu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Pedreira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.07.019"},{"key":"ref10","first-page":"208","article-title":"String averages and self-organizing map for strings","author":"fischer","year":"2000","journal-title":"Proc of the Neural Computation 2000 Canada\/ Switzerland ICSC"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2004.1333792"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s100440200003"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2013.09.014"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-70659-3_4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2019.02.004"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-70659-3_14"},{"key":"ref17","first-page":"108","article-title":"Finding median and center strings for a probability distribution on a set of strings under levenshtein distance based on integer linear programming","author":"hayashida","year":"2016","journal-title":"International Joint Conference on Biomedical Engineering Systems and Technologies"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.5220\/0005666400350041"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.07.006"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/34.643899"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2004.08.015"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ICDEW.2008.4498350"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-44871-6_95"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1025045"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.11.020"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(85)90061-3"},{"key":"ref8","first-page":"331","article-title":"Improved greedy algorithm for computing approximate median strings","volume":"14","author":"kruzslicz","year":"1999","journal-title":"Acta Cybemetica"},{"key":"ref7","first-page":"193","article-title":"A greedy algorithm for computing approximate median strings","author":"casacuberta","year":"1997","journal-title":"VII Simposium Nacional de Reconocimiento de Formas y Análisis de Imdgenes"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICME.2000.869611"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(02)00209-X"},{"key":"ref1","first-page":"222","volume":"9","author":"jusoh","year":"2009","journal-title":"Application of freeman chain codes An alternative recognition technique for Malaysian car plates"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69507-3_37"},{"key":"ref22","first-page":"67","article-title":"Indexing metric spaces with m-tree","volume":"97","author":"ciaccia","year":"1997","journal-title":"SEBD"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502808"},{"key":"ref24","first-page":"331","article-title":"Searching: an algorithmic tour","volume":"37","author":"baeza-yates","year":"1997","journal-title":"Encyclopedia of Computer Science and Technology"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-58094-8_18"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/362003.362025"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(94)90095-7"}],"event":{"name":"2019 38th International Conference of the Chilean Computer Science Society (SCCC)","start":{"date-parts":[[2019,11,4]]},"location":"Concepcion, Chile","end":{"date-parts":[[2019,11,9]]}},"container-title":["2019 38th International Conference of the Chilean Computer Science Society (SCCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8956485\/8966388\/08966441.pdf?arnumber=8966441","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:21:19Z","timestamp":1657855279000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8966441\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/sccc49216.2019.8966441","relation":{},"subject":[],"published":{"date-parts":[[2019,11]]}}}