{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:52Z","timestamp":1720640812452},"reference-count":10,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1016\/j.endm.2018.03.020","type":"journal-article","created":{"date-parts":[[2018,4,12]],"date-time":"2018-04-12T15:23:42Z","timestamp":1523546622000},"page":"151-158","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"special_numbering":"C","title":["Heuristic approaches to the Distinguishing Substring Selection Problem"],"prefix":"10.1016","volume":"66","author":[{"given":"Jean","family":"Torres","sequence":"first","affiliation":[]},{"given":"Emerson","family":"Silva","sequence":"additional","affiliation":[]},{"given":"Edna A.","family":"Hoshino","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.endm.2018.03.020_br0010","series-title":"Banishing bias from consensus sequences","first-page":"247","author":"Ben-Dor","year":"1997"},{"key":"10.1016\/j.endm.2018.03.020_br0020","series-title":"Proceedings of the Meeting on Algorithm Engineering & Expermiments, ALENEX '11","first-page":"13","article-title":"A closer look at the closest string and closest substring problem","author":"Chimani","year":"2011"},{"key":"10.1016\/j.endm.2018.03.020_br0030","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1016\/j.cor.2011.06.010","article-title":"Improved LP-based algorithms for the closest string problem","volume":"39","author":"Della Croce","year":"2012","journal-title":"Computers & Operations Research"},{"key":"10.1016\/j.endm.2018.03.020_br0040","series-title":"The SCIP optimization suite 3.2","author":"Gamrath","year":"2016"},{"key":"10.1016\/j.endm.2018.03.020_br0050","first-page":"319","article-title":"Variable neighbourhood search: methods and applications","volume":"6","author":"Hansen","year":"2008","journal-title":"A Quarterly Journal of Operations Research"},{"key":"10.1016\/j.endm.2018.03.020_br0060","unstructured":"IBM ILOG, IBM ILOG CPLEX Optimization Studio CP Optimizer User's Manual, Version 12 Release 6, 2015."},{"key":"10.1016\/j.endm.2018.03.020_br0070","series-title":"Some String Problems in Computational Biology","author":"Lanctot","year":"2000"},{"key":"10.1016\/j.endm.2018.03.020_br0080","series-title":"Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '99","first-page":"633","article-title":"Distinguishing string selection problems","author":"Lanctot","year":"1999"},{"key":"10.1016\/j.endm.2018.03.020_br0090","series-title":"Combinatorial Approaches for Problems in Bioinformatics","author":"Meneses","year":"2005"},{"key":"10.1016\/j.endm.2018.03.020_br0100","series-title":"2nd International Symposium on Mathematical and Computational Biology","first-page":"54","article-title":"Modeling and solving string selection problems","author":"Meneses","year":"2005"}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300660?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065318300660?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T14:24:14Z","timestamp":1534947854000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065318300660"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":10,"alternative-id":["S1571065318300660"],"URL":"https:\/\/doi.org\/10.1016\/j.endm.2018.03.020","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[2018,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Heuristic approaches to the Distinguishing Substring Selection Problem","name":"articletitle","label":"Article Title"},{"value":"Electronic Notes in Discrete Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.endm.2018.03.020","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2018 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}