Introduction
String barcoding is a recently introduced technique for genomic-based identification of microorganisms such as viruses or bacteria. Microorganism identification is performed by spotting or synthesizing the Watson-Crick complements of selected distinguisher strings on a microarray and hybridizing it to fluorescently labeled DNA extracted from the unknown microorganism. Alternatively, distinguisher complements can be hybridized in solution to the unlabeled DNA of the microorganism, extended with fluorescently labeled dideoxynucleotides in a polymerase mediated reaction, and then hybridized to a microarry consisting of the distinguishers themselves. In each case, the hybridization pattern can be viewed as a string of k zeros and ones, commonly referred to as the barcode of the microorganism. For unambiguous identification, barcodes corresponding to different microorganisms must be distinct.
This software package implements a version of the greedy setcover algorithm for distinguisher selection as described in the reference below. The software enforces constraints on distinguisher length, melting temperature, and GC content. Furthermore, the software enforces distinguisher hybridization specificity via an upper-bound on the maximum weight of a substring shared by two or more distinguishers, where the weight of a substring is obtained by adding the number of A and T bases and twice the number of C and G bases.
DNA-BAR source code
DNA-BAR Web-Interface
Contact Information
Related Publications
Book Chapters:
B. DasGupta and M.-Y. Kao and I.I. Mandoiu, Algorithmic Issues in DNA Barcoding Problems, In M. Elloumi and A. Zomaya, Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications, Wiley, pp. 129-142, 2011, pdf preprint
Journal Articles:
B. DasGupta and K.M. Konwar and I.I. Mandoiu and A.A. Shvartsman, DNA-BAR: Distinguisher Selection for DNA Barcoding, Bioinformatics 21, pp. 3424-3426, 2005, pdf preprint, publisher url
B. DasGupta and K.M. Konwar and I.I. Mandoiu and A.A. Shvartsman, Highly Scalable Algorithms for Robust String Barcoding, International Journal of Bioinformatics Research and Applications 1, pp. 145-161, 2005, pdf preprint, publisher url
Conference Articles:
B. DasGupta and K.M. Konwar and I.I. Mandoiu and A.A. Shvartsman, Highly Scalable Algorithms for Robust String Barcoding, Proc. 5th International Conference on Computational Science, Part II, pp. 1020-1028, 2005, pdf preprint, publisher url
Technical Reports:
B. DasGupta and K.M. Konwar and I.I. Mandoiu and A.A. Shvartsman, Highly Scalable Algorithms for Robust String Barcoding, Cornell University arXiv e-print, cs/0502065, 2005, url
Acknowledgment and Disclaimer
This material is based upon work supported in part by the National Science Foundation under awards IIS-0546457 and DBI-0543365. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the authors and do not necessarily reflect the views of the National Science Foundation.