{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T23:07:32Z","timestamp":1648595252397},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T00:00:00Z","timestamp":1154390400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/2.0"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms Mol Biol"],"published-print":{"date-parts":[[2006,8]]},"DOI":"10.1186\/1748-7188-1-12","type":"journal-article","created":{"date-parts":[[2006,8,8]],"date-time":"2006-08-08T21:31:11Z","timestamp":1155072671000},"source":"Crossref","is-referenced-by-count":1,"title":["The approximability of the String Barcoding problem"],"prefix":"10.1186","volume":"1","author":[{"given":"Giuseppe","family":"Lancia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Romeo","family":"Rizzi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,8,8]]},"reference":[{"key":"12_CR1","first-page":"254","volume-title":"Proceedings of the Annual International Conference on on Computational Molecular Biology (RECOMB)","author":"S Rash","year":"2002","unstructured":"Rash S, Gusfield D: String Barcoding: Uncovering Optimal Virus Signatures. Proceedings of the Annual International Conference on on Computational Molecular Biology (RECOMB). 2002, 254-261. ACM press"},{"issue":"2","key":"12_CR2","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1504\/IJBRA.2005.007574","volume":"1","author":"B DasGupta","year":"2005","unstructured":"DasGupta B, Konwar KM, Mandoiu II, Shvartsman A: Highly scalable algorithms for robust string barcoding. Int J of Bioinf Res and Appls. 2005, 1 (2): 145-161.","journal-title":"Int J of Bioinf Res and Appls"},{"issue":"16","key":"12_CR3","doi-asserted-by":"publisher","first-page":"3424","DOI":"10.1093\/bioinformatics\/bti547","volume":"21","author":"B DasGupta","year":"2005","unstructured":"DasGupta B, Konwar KM, Mandoiu II, Shvartsman A: DNA-BAR: distinguisher selection for DNA barcoding. Bioinf. 2005, 21 (16): 3424-3426. 10.1093\/bioinformatics\/bti547.","journal-title":"Bioinf"},{"issue":"Suppl 1","key":"12_CR4","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1093\/bioinformatics\/17.suppl_1.S39","volume":"17","author":"J Borneman","year":"2001","unstructured":"Borneman J, Chrobak M, Della Vedova G, Figueroa A, Jiang T: Probe selection algorithms with applications in the analysis of microbial communities. Bioinf. 2001, 17 (Suppl 1): 39-48.","journal-title":"Bioinf"},{"issue":"2","key":"12_CR5","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.jcss.2005.02.001","volume":"71","author":"P Berman","year":"2004","unstructured":"Berman P, DasGupta B, Kao MY: Tight approximability results for test set problems in bioinformatics. J of Comp and Sys Sc. 2004, 71 (2): 145-162. 10.1016\/j.jcss.2005.02.001. [Also in Proc. Workshop on Algorithm Theory, Lec Notes in Comp Sc, Springer, 3111:39\u201350, 2004],","journal-title":"J of Comp and Sys Sc"},{"key":"12_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS: Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979, San Francisco: W. H. Freeman and Co"},{"key":"12_CR7","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1137\/0906067","volume":"6","author":"BME Moret","year":"1985","unstructured":"Moret BME, Shapiro HD: On minimizing a set of tests. SIAM J on Sc and Stat Comp. 1985, 6: 983-1003. 10.1137\/0906067.","journal-title":"SIAM J on Sc and Stat Comp"},{"key":"12_CR8","volume-title":"Parametrized Complexity","author":"RG Downey","year":"1998","unstructured":"Downey RG, Fellows MR: Parametrized Complexity. 1998, Berlin: Springer-Verlag"},{"key":"12_CR9","volume-title":"Compl and Comp Computations","author":"RM Karp","year":"1972","unstructured":"Karp RM: Reducibility among combinatorial problems. Compl and Comp Computations. 1972"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"1\u20133","author":"KMJ De Bontridder","year":"2003","unstructured":"De Bontridder KMJ, Halld\u00f3rsson BV, Halld\u00f3rsson MM, Hurkens CAJ, Lenstra JK, Ravi R, Stougie L: Approximation algorithms for the test cover problem. Math Prog B. 2003, 1\u20133: 477-491. 10.1007\/s10107-003-0414-6.","journal-title":"Math Prog B"},{"key":"12_CR11","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen TH, Leiserson CE, Rivest RL: Introduction to Algorithms. 2001, Boston: MIT press"},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U: A threshold of for approximating set cover. J ACM. 1998, 45: 634-652. 10.1145\/285055.285059.","journal-title":"J ACM"}],"container-title":["Algorithms for Molecular Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-1-12.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/1748-7188-1-12\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/1748-7188-1-12.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,21]],"date-time":"2019-01-21T23:35:54Z","timestamp":1548113754000},"score":1,"resource":{"primary":{"URL":"https:\/\/almob.biomedcentral.com\/articles\/10.1186\/1748-7188-1-12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,8]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,8]]}},"alternative-id":["12"],"URL":"https:\/\/doi.org\/10.1186\/1748-7188-1-12","relation":{},"ISSN":["1748-7188"],"issn-type":[{"value":"1748-7188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,8]]},"article-number":"12"}}