{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T01:23:52Z","timestamp":1743125032961,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223436"},{"type":"electronic","value":"9783540248552"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24855-2_139","type":"book-chapter","created":{"date-parts":[[2010,9,14]],"date-time":"2010-09-14T08:20:59Z","timestamp":1284452459000},"page":"1305-1306","source":"Crossref","is-referenced-by-count":1,"title":["A Genetic Algorithm for the Shortest Common Superstring Problem"],"prefix":"10.1007","author":[{"given":"Luis C.","family":"Gonz\u00e1lez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heidi J.","family":"Romero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos A.","family":"Brizuela","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"139_CR1","doi-asserted-by":"crossref","unstructured":"Brizuela, C., Gonz\u00e1lez, L., Romero, H.: An Improved Genetic Algorithm for the Sequencing by Hybridization Problem. In: Proceedings of the 2nd European Workshop on Evolutionary Bioinformatics, EvoBIO (2004) (to appear)","DOI":"10.1007\/978-3-540-24653-4_2"},{"key":"139_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"139_CR3","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)"},{"key":"139_CR4","doi-asserted-by":"publisher","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"Held, M., Karp, R.: The Traveling Salesman Problem and Minimum Spanning Trees. Operations Research\u00a018, 1138\u20131162 (1970)","journal-title":"Operations Research"}],"container-title":["Lecture Notes in Computer Science","Genetic and Evolutionary Computation \u2013 GECCO 2004"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24855-2_139","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T03:32:01Z","timestamp":1676691121000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-24855-2_139"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223436","9783540248552"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24855-2_139","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}