TY - CHAP AU - Rash, S. AU - Gusfield, D. PY - 2002 DA - 2002// TI - String Barcoding: Uncovering Optimal Virus Signatures BT - Proceedings of the Annual International Conference on on Computational Molecular Biology (RECOMB) PB - ACM press CY - New York City ID - Rash2002 ER - TY - JOUR AU - DasGupta, B. AU - Konwar, K. M. AU - Mandoiu, I. I. AU - Shvartsman, A. PY - 2005 DA - 2005// TI - Highly scalable algorithms for robust string barcoding JO - Int J of Bioinf Res and Appls VL - 1 UR - https://doi.org/10.1504/IJBRA.2005.007574 DO - 10.1504/IJBRA.2005.007574 ID - DasGupta2005 ER - TY - JOUR AU - DasGupta, B. AU - Konwar, K. M. AU - Mandoiu, I. I. AU - Shvartsman, A. PY - 2005 DA - 2005// TI - DNA-BAR: distinguisher selection for DNA barcoding JO - Bioinf VL - 21 UR - https://doi.org/10.1093/bioinformatics/bti547 DO - 10.1093/bioinformatics/bti547 ID - DasGupta2005 ER - TY - JOUR AU - Borneman, J. AU - Chrobak, M. AU - Della Vedova, G. AU - Figueroa, A. AU - Jiang, T. PY - 2001 DA - 2001// TI - Probe selection algorithms with applications in the analysis of microbial communities JO - Bioinf VL - 17 UR - https://doi.org/10.1093/bioinformatics/17.suppl_1.S39 DO - 10.1093/bioinformatics/17.suppl_1.S39 ID - Borneman2001 ER - TY - JOUR AU - Berman, P. AU - DasGupta, B. AU - Kao, M. Y. PY - 2004 DA - 2004// TI - Tight approximability results for test set problems in bioinformatics JO - J of Comp and Sys Sc VL - 71 UR - https://doi.org/10.1016/j.jcss.2005.02.001 DO - 10.1016/j.jcss.2005.02.001 ID - Berman2004 ER - TY - BOOK AU - Garey, M. R. AU - Johnson, D. S. PY - 1979 DA - 1979// TI - Computers and Intractability: A Guide to the Theory of NP-Completeness PB - W. H. Freeman and Co CY - San Francisco ID - Garey1979 ER - TY - JOUR AU - Moret, B. M. E. AU - Shapiro, H. D. PY - 1985 DA - 1985// TI - On minimizing a set of tests JO - SIAM J on Sc and Stat Comp VL - 6 UR - https://doi.org/10.1137/0906067 DO - 10.1137/0906067 ID - Moret1985 ER - TY - BOOK AU - Downey, R. G. AU - Fellows, M. R. PY - 1998 DA - 1998// TI - Parametrized Complexity PB - Springer-Verlag CY - Berlin ID - Downey1998 ER - TY - CHAP AU - Karp, R. M. PY - 1972 DA - 1972// TI - Reducibility among combinatorial problems BT - Compl and Comp Computations ID - Karp1972 ER - TY - JOUR AU - De Bontridder, K. M. J. AU - Halldórsson, B. V. AU - Halldórsson, M. M. AU - Hurkens, C. A. J. AU - Lenstra, J. K. AU - Ravi, R. AU - Stougie, L. PY - 2003 DA - 2003// TI - Approximation algorithms for the test cover problem JO - Math Prog B VL - 1–3 UR - https://doi.org/10.1007/s10107-003-0414-6 DO - 10.1007/s10107-003-0414-6 ID - De Bontridder2003 ER - TY - BOOK AU - Cormen, T. H. AU - Leiserson, C. E. AU - Rivest, R. L. PY - 2001 DA - 2001// TI - Introduction to Algorithms PB - MIT press CY - Boston ID - Cormen2001 ER - TY - JOUR AU - Feige, U. PY - 1998 DA - 1998// TI - A threshold of for approximating set cover JO - J ACM VL - 45 UR - https://doi.org/10.1145/285055.285059 DO - 10.1145/285055.285059 ID - Feige1998 ER -