{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:00:19Z","timestamp":1725559219332},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540260431"},{"type":"electronic","value":"9783540321149"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11428848_129","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T13:44:33Z","timestamp":1279115073000},"page":"1020-1028","source":"Crossref","is-referenced-by-count":1,"title":["Highly Scalable Algorithms for Robust String Barcoding"],"prefix":"10.1007","author":[{"given":"B.","family":"DasGupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"K. M.","family":"Konwar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I. I.","family":"M\u0103ndoiu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. A.","family":"Shvartsman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"129_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-27810-8_5","volume-title":"Algorithm Theory - SWAT 2004","author":"P. Berman","year":"2004","unstructured":"Berman, P., DasGupta, B., Kao, M.-Y.: Tight approximability results for test set problems in bioinformatics. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 39\u201350. Springer, Heidelberg (2004)"},{"key":"129_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-27821-4_4","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"P. Berman","year":"2004","unstructured":"Berman, P., DasGupta, B., Sontag, E.: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 39\u201350. Springer, Heidelberg (2004)"},{"key":"129_CR3","first-page":"1","volume":"1","author":"J. Borneman","year":"2001","unstructured":"Borneman, J., Chrobak, M., Vedova, G.D., Figueora, A., Jiang, T.: Probe selection algorithms with applications in the analysis of microbial communities. Bioinformatics\u00a01, 1\u20139 (2001)","journal-title":"Bioinformatics"},{"key":"129_CR4","unstructured":"Cazalis, D., Milledge, T., Narasimhan, G.: Probe selection problem: Structure and algorithms. In: Proc. 8th Multi-Conference on Systemics, Cybernetics and Informatics (SCI 2004), pp. 124\u2013129 (2004)"},{"key":"129_CR5","doi-asserted-by":"publisher","first-page":"14676","DOI":"10.1073\/pnas.93.25.14676","volume":"93","author":"V.G. Cheung","year":"1996","unstructured":"Cheung, V.G., Nelson, S.F.: Whole genome amplification using a degenerate oligonucleotide primer allows hundreds of genotypes to be performed on less than one nanogram of genomic dna. Proc. Natl. Acad. Sci. USA.\u00a093, 14676\u201314679 (1996)","journal-title":"Proc. Natl. Acad. Sci. USA."},{"key":"129_CR6","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"Chv\u00e1tal, V.: A greedy heuristic for the set covering problem. Math. of Op. Res.\u00a04, 233\u2013235 (1979)","journal-title":"Math. of Op. Res."},{"key":"129_CR7","unstructured":"NCBI Completed Microbial Genomes (2004), \n                    \n                      http:\/\/www.ncbi.nlm.nih.gov\/genomes\/microbes\/complete.html"},{"key":"129_CR8","unstructured":"DasGupta, B., Konwar, K., Mandoiu, I.I., Shvartsman, A.: Highly scalable algorithms for robust string barcoding. ACM Computing Research Repository (2005) cs.DS\/0502065"},{"key":"129_CR9","doi-asserted-by":"publisher","first-page":"5261","DOI":"10.1073\/pnas.082089499","volume":"99","author":"F.B. Dean","year":"2002","unstructured":"Dean, F.B., Hosono, S., Fang, L., Wu, X., Fawad Faruqi, A., Bray-Ward, P., Sun, Z., Zong, Q., Du, Y., Du, J., Driscoll, M., Song, W., Kingsmore, S.F., Egholm, M., Lasken, R.S.: Comprehensive human genome amplification using multiple displacement amplification. Proc. Natl. Acad. Sci. USA.\u00a099, 5261\u20135266 (2002)","journal-title":"Proc. Natl. Acad. Sci. USA."},{"key":"129_CR10","doi-asserted-by":"crossref","unstructured":"Gharizadeh, B., K\u00e4ller, M., Nyr\u00e9n, P., Andersson, A., Uhl\u00e9n, M., Lundeberg, J., Ahmadian, A.: Viral and microbial genotyping by a combination of multiplex competitive hybridization and specific extension followed by hybridization to generic tag arrays. Nucleic Acids Research\u00a031(22) (2003)","DOI":"10.1093\/nar\/gng147"},{"key":"129_CR11","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. J. Comput. Sys. Sci.\u00a09, 256\u2013278 (1974)","journal-title":"J. Comput. Sys. Sci."},{"key":"129_CR12","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1093\/bioinformatics\/18.suppl_1.S172","volume":"181","author":"C. Linhart","year":"2002","unstructured":"Linhart, C., Shamir, R.: The degenerate primer design problem. Bioinformatics\u00a0181, S172\u2013S181 (2002)","journal-title":"Bioinformatics"},{"key":"129_CR13","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lov\u00e1sz","year":"1975","unstructured":"Lov\u00e1sz, L.: On the ratio of optimal integral and fractional covers. Discrete Mathematics\u00a013, 383\u2013390 (1975)","journal-title":"Discrete Mathematics"},{"key":"129_CR14","doi-asserted-by":"crossref","unstructured":"Rash, S., Gusfield, D.: String barcoding: Uncovering optimal virus signatures. In: Proc. 6th Annual International Conference on Computational Biology, pp. 254\u2013261 (2002)","DOI":"10.1145\/565196.565229"},{"key":"129_CR15","doi-asserted-by":"crossref","unstructured":"Souvenir, R., Buhler, J., Stormo, G., Zhang, W.: Selecting degenerate multiplex PCR primers. In: Proc. 3rd Intl. Workshop on Algorithms in Bioinformatics (WABI), pp. 512\u2013526 (2003)","DOI":"10.1007\/978-3-540-39763-2_36"},{"key":"129_CR16","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11428848_129","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,16]],"date-time":"2019-03-16T16:06:59Z","timestamp":1552752419000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11428848_129"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540260431","9783540321149"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11428848_129","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}