{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,10,24]],"date-time":"2022-10-24T11:30:19Z","timestamp":1666611019781},"reference-count":57,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2978893","type":"journal-article","created":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T22:32:27Z","timestamp":1583533947000},"page":"45231-45243","source":"Crossref","is-referenced-by-count":1,"title":["A General Approach to Uniformly Handle Different String Metrics Based on Heterogeneous Alphabets"],"prefix":"10.1109","volume":"8","author":[{"given":"Francesco","family":"Cauteruccio","sequence":"first","affiliation":[]},{"given":"Alessandro","family":"Cucchiarelli","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-0244-9322","authenticated-orcid":false,"given":"Christian","family":"Morbidoni","sequence":"additional","affiliation":[]},{"given":"Giorgio","family":"Terracina","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-1360-8499","authenticated-orcid":false,"given":"Domenico","family":"Ursino","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"236","article-title":"Delta-gamma-parameterized matching","volume":"5280","author":"lee","year":"2008","journal-title":"Proc 15th Int Symp String Process Inf Retr (SPIRE)"},{"key":"ref38","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/978-3-540-73437-6_27","article-title":"Algorithms for computing the longest parameterized common subsequence","volume":"4580","author":"costas","year":"2007","journal-title":"Proc Annual Symp on Combinatorial Pattern Matching (CPM)"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.akcej.2016.11.010"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1273340.1273345"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02432-5_26"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1080\/00207160213939"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.09.011"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2013.03.016"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2006.10.001"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.jda.2006.03.014"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.05.016"},{"key":"ref27","first-page":"121","article-title":"Approximate abelian periods to find motifs in biological sequences","volume":"8623","author":"mendivelso","year":"2014","journal-title":"Proc Int Meeting Comput Intell Methods Bioinf Biostatistics"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/RAETCS.2018.8443925"},{"key":"ref2","first-page":"71","article-title":"A theory of parameterized pattern matching: Algorithms and applications (extended abstract)","author":"baker","year":"1993","journal-title":"Proc Annu ACM Symp Theory Comput"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/0206024"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07566-2_14"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.015"},{"key":"ref21","first-page":"8:1","author":"diptarama","year":"2017","journal-title":"Position Heaps for Parameterized Strings"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2002.1019480"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/02522667.2016.1139847"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1764810.1764829"},{"key":"ref25","first-page":"854","article-title":"Parameterized diff","author":"baker","year":"1999","journal-title":"Proc 6th Ann ACM-SIAM Symp on Discrete Algorithms"},{"key":"ref50","first-page":"403","article-title":"Extracting parallel sentences from comparable corpora using document level alignment","author":"smith","year":"2010","journal-title":"Proc Hum Lang Technol Annu Conf North Amer Chapter Assoc Comput Linguistics (NAACL HLT)"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/W14-1009"},{"key":"ref57","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Sov Phys Doklady"},{"key":"ref56","first-page":"2851","article-title":"The longest common parameterized subsequence problem","volume":"6","author":"gorbenko","year":"2012","journal-title":"Appl Math Sci"},{"key":"ref55","first-page":"13","article-title":"Improvements in part-of-speech tagging with an application to German","author":"schmid","year":"1995","journal-title":"ACL Workshop SIGDAT"},{"key":"ref54","first-page":"154","article-title":"Probabilistic part-of-speech tagging using decision trees","author":"schmid","year":"1994","journal-title":"Proc Int Conf New Methods Lang Process"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W17-2512"},{"key":"ref52","first-page":"79","article-title":"Europarl: A parallel corpus for statistical machine translation","author":"koehn","year":"2005","journal-title":"Proceedings of the 10th Machine Translation Summit"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2018.03.018"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2014.04.035"},{"key":"ref40","first-page":"39","article-title":"Overview of the third bucc shared task: Spotting parallel sentences in comparable corpora","author":"rapp","year":"2018","journal-title":"Proceedings of Building and Using Comparable Corpora workshop"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.03.011"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2018.04.003"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2014.07.015"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.07.029"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2006.04.012"},{"key":"ref17","first-page":"13","article-title":"A survey of text similarity approaches","volume":"68","author":"gomaa","year":"2013","journal-title":"Int J Comput Appl"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11704-015-5900-5"},{"key":"ref19","first-page":"118","article-title":"Parameterized matching: Solutions and extensions","author":"mendivelso","year":"2015","journal-title":"Proc Prague Stringology Conf"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2018.11.010"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1186\/1745-6150-1-11","article-title":"A survey of motif discovery methods in an integrated framework","volume":"1","author":"sandve","year":"2006","journal-title":"Biol Direct"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2007.250581"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.compbiomed.2016.07.015"},{"key":"ref8","first-page":"275","article-title":"A review on parameterized string matching algorithms","volume":"39","author":"singh","year":"2017","journal-title":"J Inf Optim Sci"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2018.07.017"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1177"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1002\/9780470882207.ch8"},{"key":"ref46","first-page":"1","article-title":"Extracting parallel sentences from comparable corpora with stacc variants","author":"andoni azpeitia","year":"2018","journal-title":"Proc Int Conf Lang Res Eval (LREC)"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-018-1179-9"},{"key":"ref48","first-page":"43","article-title":"H2@BUCC18: Parallel sentence extraction from comparable corpora using multilingual sentence embeddings","author":"bouamor","year":"2018","journal-title":"Proc Int Conf Lang Res Eval (LREC)"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W17-2508"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/2766462.2767752"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/W16-2301"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/P16-1189"},{"key":"ref43","first-page":"1","article-title":"Baselines and test data for cross-lingual inference","author":"agi?","year":"2018","journal-title":"Proc Int Conf Lang Res Eval (LREC)"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09026883.pdf?arnumber=9026883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T01:09:27Z","timestamp":1641949767000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9026883\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":57,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2978893","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}