{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T08:27:47Z","timestamp":1742632067746},"reference-count":14,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0031-3203(97)00058-7","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T02:45:35Z","timestamp":1049510735000},"page":"431-440","source":"Crossref","is-referenced-by-count":10,"title":["Optimizing the cost matrix for approximate string matching using genetic algorithms"],"prefix":"10.1016","volume":"31","author":[{"given":"Marc","family":"Parizeau","sequence":"first","affiliation":[]},{"given":"Nadia","family":"Ghazzali","sequence":"additional","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"H\u00e9bert","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0031-3203(97)00058-7_BIB1","series-title":"Syntactic Pattern Recognition: An Introduction","author":"Gonzales","year":"1978"},{"key":"10.1016\/S0031-3203(97)00058-7_BIB2","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"Levenshtein","year":"1966","journal-title":"Sov. Phy. Dokl."},{"key":"10.1016\/S0031-3203(97)00058-7_BIB3","series-title":"Time Warps, String Edits and Macromolecules: The Theory and Practice of Sequence Comparison","author":"Sankoff","year":"1983"},{"issue":"1","key":"10.1016\/S0031-3203(97)00058-7_BIB4","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"},{"issue":"1","key":"10.1016\/S0031-3203(97)00058-7_BIB5","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/BF02458834","article-title":"Approximate matching of regular expressions","volume":"51","author":"Myers","year":"1989","journal-title":"Bull. Math. Biol."},{"issue":"12","key":"10.1016\/S0031-3203(97)00058-7_BIB6","doi-asserted-by":"crossref","first-page":"1797","DOI":"10.1016\/0031-3203(93)90177-X","article-title":"Applications of approximate string matching to 21) shape recognition","volume":"26","author":"Bunke","year":"1993","journal-title":"Pattern Recognition"},{"issue":"9","key":"10.1016\/S0031-3203(97)00058-7_BIB7","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1109\/34.232078","article-title":"Computation of normalized edit distance and applications","volume":"15","author":"Marzal","year":"1993","journal-title":"IEEE Trans. Pattern Recognition Machine Intell."},{"issue":"9","key":"10.1016\/S0031-3203(97)00058-7_BIB8","doi-asserted-by":"crossref","first-page":"899","DOI":"10.1109\/34.406656","article-title":"Fast computation of normalized edit distances","volume":"PAMI-17","author":"Vidal","year":"1995","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"10.1016\/S0031-3203(97)00058-7_BIB9","first-page":"549","article-title":"Inference of edit costs using parametric string matching","volume":"Vol. II","author":"Bunke","year":"1992"},{"key":"10.1016\/S0031-3203(97)00058-7_BIB10","series-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg","year":"1989"},{"key":"10.1016\/S0031-3203(97)00058-7_BIB11","series-title":"Genetic Algorithms + Data Structures = Evolution Programs","author":"Michalewicz","year":"1992"},{"key":"10.1016\/S0031-3203(97)00058-7_BIB12","series-title":"Introduction to Statistical Pattern Recognition","author":"Fukunaga","year":"1990"},{"key":"10.1016\/S0031-3203(97)00058-7_BIB13","first-page":"29","article-title":"UNIPEN project of on-line data exchange and recognizer benchmarks","volume":"Vol. II","author":"Guyon","year":"1994"},{"issue":"4","key":"10.1016\/S0031-3203(97)00058-7_BIB14","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1109\/TSMC.1985.6313426","article-title":"A fuzzy k-nearest neighbor algorithm","volume":"SMC-15","author":"Keller","year":"1985","journal-title":"IEEE Trans. System Man Cybernet."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320397000587?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0031320397000587?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T17:25:53Z","timestamp":1556385953000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0031320397000587"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0031320397000587"],"URL":"https:\/\/doi.org\/10.1016\/s0031-3203(97)00058-7","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}