{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T17:33:46Z","timestamp":1778607226635,"version":"3.51.4"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100010801","name":"Xunta de Galicia","doi-asserted-by":"publisher","award":["CSI ED431G\/01"],"award-info":[{"award-number":["CSI ED431G\/01"]}],"id":[{"id":"10.13039\/501100010801","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100010801","name":"Xunta de Galicia","doi-asserted-by":"publisher","award":["GRC: ED431C 2017\/58"],"award-info":[{"award-number":["GRC: ED431C 2017\/58"]}],"id":[{"id":"10.13039\/501100010801","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Universidad Catlica de Temuco","award":["2020EM-PS-08"],"award-info":[{"award-number":["2020EM-PS-08"]}]},{"name":"Universidad Catlica de Temuco","award":["FEQUIP 2019-INRN-03"],"award-info":[{"award-number":["FEQUIP 2019-INRN-03"]}]},{"DOI":"10.13039\/501100008736","name":"Fondo de Fomento al Desarrollo Cientfico y Tecnolgico","doi-asserted-by":"publisher","award":["1170497"],"award-info":[{"award-number":["1170497"]}],"id":[{"id":"10.13039\/501100008736","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008736","name":"Fondo de Fomento al Desarrollo Cientfico y Tecnolgico","doi-asserted-by":"publisher","award":["2014-63140074"],"award-info":[{"award-number":["2014-63140074"]}],"id":[{"id":"10.13039\/501100008736","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3137767","type":"journal-article","created":{"date-parts":[[2021,12,23]],"date-time":"2021-12-23T22:22:35Z","timestamp":1640298155000},"page":"169299-169308","source":"Crossref","is-referenced-by-count":2,"title":["Boosting Perturbation-Based Iterative Algorithms to Compute the Median String"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7345-6007","authenticated-orcid":false,"given":"Pedro","family":"Mirabal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4637-4206","authenticated-orcid":false,"given":"Jose","family":"Abreu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2514-9907","authenticated-orcid":false,"given":"Diego","family":"Seco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oscar","family":"Pedreira","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0148-695X","authenticated-orcid":false,"given":"Edgar","family":"Chavez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.2174\/1574893609666140516010143"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24583-1_41"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-2312(98)00031-9"},{"key":"ref32","first-page":"143","article-title":"Ensemble methods in the clustering of string patterns","author":"louren\u00e7o","year":"2005","journal-title":"Proc 7th IEEE Workshops Appl Comput Vis (WACV\/MOTIONS)"},{"key":"ref31","first-page":"300","article-title":"Computation of median shapes","author":"jiang","year":"2000","journal-title":"Proc 4th Asian Conf Comput Vis"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2008.2007248"},{"key":"ref37","article-title":"Dynamic relative compression","author":"bille","year":"2015","journal-title":"CoRR"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.12.030"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2012.6404708"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2015.7280576"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2019.02.004"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(01)00122-2"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiolchem.2015.07.010"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s100440200003"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2013.09.014"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.07.006"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.5220\/0005666400350041"},{"key":"ref21","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":"Proc Int Joint Conf Biomed Eng Syst Technol"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89689-0_47"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-70659-3_14"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34166-3_8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/34.682181"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2012.11.019"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8655(85)90061-3"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/1025045"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1093\/bib\/bbt088"},{"key":"ref12","first-page":"331","article-title":"Improved greedy algorithm for computing approximate median strings","volume":"14","author":"kruzslicz","year":"1999","journal-title":"Acta Cybern"},{"key":"ref13","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Soviet Phys Doklady"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-70659-3_4"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(02)00209-X"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2011.07.019"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2004.08.015"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0076-6879(96)66008-X"},{"key":"ref19","first-page":"235","article-title":"Half-space proximal: A new local test for extracting a bounded dilation spanner of a unit disk graph","volume":"1","author":"chavez","year":"2005","journal-title":"Proc Int Conf Princ Distrib Syst"},{"key":"ref4","first-page":"193","article-title":"A greedy algorithm for computing approximate median strings","author":"casacuberta","year":"1997","journal-title":"Proc VII Sim Nac de Reconocimiento de Formas y An&#x00E1;lisis de Im&#x00E1;genes"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICPR.2004.1333792"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/356625.356627"},{"key":"ref5","first-page":"208","article-title":"String averages and self-organizing maps for strings","author":"fischer","year":"2000","journal-title":"Proc ICSC Neural Comput"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/34.643899"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2010.11.020"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1142\/9789812565402_0008"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.3390\/sym12081363"},{"key":"ref45","article-title":"Algoritmos para el c&#x00E1;lculo de la cadena media","author":"mirabal","year":"2019"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-021-06178-2"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.48"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/SCCC49216.2019.8966441"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-013-1468-x"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/SCCC51225.2020.9281222"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/SCCC51225.2020.9281215"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09661386.pdf?arnumber=9661386","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,21]],"date-time":"2022-02-21T22:14:43Z","timestamp":1645481683000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9661386\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3137767","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}