{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:11:04Z","timestamp":1742998264230,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319596044"},{"type":"electronic","value":"9783319596051"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59605-1_8","type":"book-chapter","created":{"date-parts":[[2017,5,22]],"date-time":"2017-05-22T15:06:26Z","timestamp":1495465586000},"page":"79-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Designing and Implementing Algorithms for the Closest String Problem"],"prefix":"10.1007","author":[{"given":"Shota","family":"Yuasa","sequence":"first","affiliation":[]},{"given":"Zhi-Zhong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,23]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/j.jcss.2011.01.003","volume":"78","author":"Z-Z Chen","year":"2012","unstructured":"Chen, Z.-Z., Ma, B., Wang, L.: A three-string approach to the closest string problem. J. Comput. Syst. Sci. 78, 164\u2013178 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"8_CR2","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1109\/TCBB.2011.21","volume":"8","author":"Z-Z Chen","year":"2011","unstructured":"Chen, Z.-Z., Wang, L.: Fast exact algorithms for the closest string and substring problems with application to the planted $$(\\ell, d)$$-motif model. IEEE\/ACM Trans. Comput. Biol. Bioinf. 8(5), 1400\u20131410 (2011)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/s00453-014-9952-y","volume":"74","author":"Z-Z Chen","year":"2016","unstructured":"Chen, Z.-Z., Ma, B., Wang, L.: Randomized fixed-parameter algorithms for the closest string problem. Algorithmica 74, 466\u2013484 (2016)","journal-title":"Algorithmica"},{"key":"8_CR4","first-page":"113","volume":"30","author":"M Frances","year":"1997","unstructured":"Frances, M., Litman, A.: On covering problems of codes. Theoret. Comput. Sci. 30, 113\u2013119 (1997)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00453-003-1028-3","volume":"37","author":"J Gramm","year":"2003","unstructured":"Gramm, J., Niedermeier, R., Rossmanith, P.: Fixed-parameter algorithms for closest string and related problems. Algorithmica 37, 25\u201342 (2003)","journal-title":"Algorithmica"},{"key":"8_CR6","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1186\/1471-2105-12-106","volume":"12","author":"F Hufsky","year":"2011","unstructured":"Hufsky, F., Kuchenbecker, L., Jahn, K., Stoye, J., B\u00f6cker, S.: Swiftly computing center strings. BMC Bioinform. 12, 106 (2011)","journal-title":"BMC Bioinform."},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"K Lanctot","year":"2003","unstructured":"Lanctot, K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string search problems. Inform. Comput. 185, 41\u201355 (2003)","journal-title":"Inform. Comput."},{"issue":"4","key":"8_CR8","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1137\/080739069","volume":"39","author":"B Ma","year":"2010","unstructured":"Ma, B., Sun, X.: More efficient algorithms for closest string and substring problems. SIAM J. Comput. 39(4), 1432\u20131443 (2010)","journal-title":"SIAM J. Comput."},{"doi-asserted-by":"crossref","unstructured":"Nicolae, M., Rajasekaran, S.: qPMS9: an efficient algorithm for quorum planted motif search. Nat. Sci. Rep. 5 (2015)","key":"8_CR9","DOI":"10.1038\/srep07813"},{"key":"8_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-642-33293-7_24","volume-title":"Parameterized and Exact Computation","author":"N Nishimura","year":"2012","unstructured":"Nishimura, N., Simjour, N.: Enumerating neighbour and closest strings. In: Thilikos, D.M., Woeginger, G.J. (eds.) IPEC 2012. LNCS, vol. 7535, pp. 252\u2013263. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-33293-7_24"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1109\/TCBB.2014.2306842","volume":"11","author":"S Tanaka","year":"2014","unstructured":"Tanaka, S.: Improved exact enumerative algorithms for the planted (l, d)-motif search problem (2014). IEEE\/ACM Trans. Comput. Biol. Bioinf. 11, 361\u2013374 (2014)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59605-1_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:25:59Z","timestamp":1710343559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-59605-1_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319596044","9783319596051"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59605-1_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"23 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FAW","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Frontiers in Algorithmics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chengdu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"faw2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/faw2017.uestc.edu.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}