{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:48:36Z","timestamp":1760647716183,"version":"3.37.3"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1109\/access.2022.3218003","type":"journal-article","created":{"date-parts":[[2022,11,4]],"date-time":"2022-11-04T00:53:39Z","timestamp":1667523219000},"page":"115869-115883","source":"Crossref","is-referenced-by-count":3,"title":["A Heuristic Solution to the Closest String Problem Using Wave Function Collapse Techniques"],"prefix":"10.1109","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9292-8743","authenticated-orcid":false,"given":"Shirley","family":"Xu","sequence":"first","affiliation":[{"name":"The Bishop’s School, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Perkins","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Hamilton College, Clinton, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"633","article-title":"Distinguish string search problems","volume-title":"Proc. 10th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Lanctot"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/506147.506150"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.70"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78839-3_33"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-003-1028-3"},{"volume-title":"Wave Function Collapse","year":"2016","author":"Gumin","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3102071.3110566"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3472538.3472605"},{"key":"ref9","first-page":"905","article-title":"Efficient approximation algorithms for the Hamming center problem","volume-title":"Proc. 10th Annu. ACM SIAM Symp. Discrete Algorithms","author":"Gasieniec"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/11527503_70"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICBBE.2008.171"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11266-9_31"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.05.020"},{"article-title":"Optimization, learning and natural algorithms","year":"1992","author":"Dorigo","key":"ref14"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/4235.585892"},{"volume-title":"Wave Function Collapse Explained","year":"2021","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/301250.301376"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/oxfordjournals.molbev.a040138"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.1040.0090"},{"key":"ref20","first-page":"326","article-title":"Parallel algorithm for the closest string problem","volume-title":"Proc. 1st Int. Symp. Math. Comput. Biol.","volume":"2","author":"Gomes"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2007.04.002"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2011.01.009"},{"key":"ref23","first-page":"287","article-title":"Largest distance decreasing algorithm for the closest string problem","volume":"1","author":"Liu","year":"2004","journal-title":"J. Inf. Comput. Sci."},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1230100.1230119"},{"key":"ref25","article-title":"Wave function collapse coloring: A new heuristic for fast vertex coloring","author":"Mac","year":"2021","journal-title":"arXiv:2108.09329"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09932602.pdf?arnumber=9932602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,12]],"date-time":"2024-01-12T00:18:04Z","timestamp":1705018684000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9932602\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3218003","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2022]]}}}