Highly scalable algorithms for robust string barcoding

Lecture Notes in Computer Science

Volumn 3515, Issue II, 2005, Pages 1020-1028

  DasGupta, B ^a   Konwar, K M ^b   Mandoiu I I ^b   Shvartsman, A A ^b  

^a University of Illinois at Chicago   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA ACQUISITION; GENES; MICROORGANISMS; RANDOM PROCESSES; BAR CODES; INFORMATION THEORY;

GENOMIC SEQUENCE; GENOMIC-BASED IDENTIFICATION; ROBUST STRING BARCODING; DISTINGUISHERS; GENOMIC DATA; INFORMATION-THEORETIC LOWER BOUNDS; SCALABLE ALGORITHMS; SELECTION BASED;

BAR CODES; BACTERIA;

EID: 25144505788     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11428848_129     Document Type: Conference Paper

References (17)

1. P. Berman, B. DasGupta, and M.-Y. Kao. Tight approximability results for test set problems in bioinformatics. In Proc. 9th Scandinavian Workshop on Algorithm Theory (SWAT), volume 3111 of Lecture Notes in Computer Science, pages 39-50, Berlin, 2004. Springer-Verlag.
2. P. Berman, B. DasGupta, and E. Sontag. Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks. In Proc. 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX), volume 2748 of Lecture Notes in Computer Science, pages 39-50, Berlin, 2004. Springer-Verlag
3. (To appear in Discrete Applied Mathematics.).
4. J. Borneman, M. Chrobak, G.D. Vedova, A. Figueora, and T. Jiang. Probe selection algorithms with applications in the analysis of microbial communities. Bioinformatics, 1:1-9, 2001.
5. D. Cazalis, T.Milledge, and G. Narasimhan. Probe selection problem: Structure and algorithms. In Proc. 8th Multi-Conference on Systemics, Cybernetics and Informatics (SCI 2004), pages 124-129, 2004.
6. V.G. Cheung and S.F. Nelson. 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., 93:14676-14679, 1996.
7. V. Chvátal. A greedy heuristic for the set covering problem. Math, of Op. Res., 4:233-235, 1979.
8. NCBI Completed Microbial Genomes, http://www.ncbi.nlm.nih.gov/genomes/microbes/complete.html, 2004.
9. B. DasGupta, K. Konwar, I.I. Mandoiu, and A. Shvartsman. Highly scalable algorithms for robust string barcoding. ACM Computing Research Repository, cs.DS/0502065, 2005.
10. F.B. Dean, S. Hosono, L. Fang, X. Wu, A. Fawad Faruqi, P. Bray-Ward, Z. Sun, Q. Zong, Y. Du, J. Du, M. Driscoll, W. Song, S.F. Kingsmore, M. Egholm, and R.S. Lasken. Comprehensive human genome amplification using multiple displacement amplification. Proc. Natl. Acad. Sci. USA., 99:5261-5266, 2002.
11. B. Gharizadeh, M. Käller, P. Nyrén, A. Andersson, M. Uhlén, J. Lundeberg, and A. Ahmadian. Viral and microbial genotyping by a combination of multiplex competitive hybridization and specific extension followed by hybridization to generic tag arrays. Nucleic Acids Research, 31(22), 2003.
12. D.S. Johnson. Approximation algorithms for combinatorial problems. J. Comput. Sys. Sci., 9:256-278, 1974.
13. C. Linhart and R. Shamir. The degenerate primer design problem. Bioinformatics, 18:8172-8181, 2002.
14. L. Lovász. On the ratio of optimal integral and fractional covers. Discrete Mathematics, 13:383-390, 1975.
15. S. Rash and D. Gusfield. String barcoding: Uncovering optimal virus signatures. In Proc. 6th Annual International Conference on Computational Biology, pages 254-261, 2002.
16. R. Souvenir, J. Buhler, G. Stormo, and W. Zhang. Selecting degenerate multiplex PCR primers. In Proc. 3rd Intl. Workshop on Algorithms in Bioinformatics (WABI), pages 512-526, 2003.
17. V.V. Vazirani. Approximation Algorithms. Springer-Verlag, Berlin, 2001.