{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:33Z","timestamp":1725549933462},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540289326"},{"type":"electronic","value":"9783540318149"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11554714_8","type":"book-chapter","created":{"date-parts":[[2005,12,15]],"date-time":"2005-12-15T00:47:00Z","timestamp":1134607620000},"page":"88-96","source":"Crossref","is-referenced-by-count":0,"title":["The String Barcoding Problem is NP-Hard"],"prefix":"10.1007","author":[{"given":"Marcello","family":"Dalpasso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe","family":"Lancia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (2001)"},{"key":"8_CR2","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co, New York (1979)"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. Complexity and Computer Computations (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Rash, S., Gusfield, D.: String Barcoding: Uncovering Optimal Virus Signatures. In: Proceedings of the Annual International Conference on Computational Molecular Biology (RECOMB). ACM Press, New York (2002)","DOI":"10.1145\/565196.565229"}],"container-title":["Lecture Notes in Computer Science","Comparative Genomics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11554714_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:06:57Z","timestamp":1619492817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11554714_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540289326","9783540318149"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/11554714_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}