Highly Scalable Algorithms for Robust String Barcoding

Details Highly Scalable Algorithms for Robust String Barcoding Highly Scalable Algorithms for Robust String Barcoding

2005-02-14

arxiv.org/abs/cs/0502065v1

Computer Science

Data Structures and Algorithms

Scientific paper

String barcoding is a recently introduced technique for genomic-based identification of microorganisms. In this paper we describe the engineering of highly scalable algorithms for robust string barcoding. Our methods enable distinguisher selection based on whole genomic sequences of hundreds of microorganisms of up to bacterial size on a well-equipped workstation, and can be easily parallelized to further extend the applicability range to thousands of bacterial size genomes. Experimental results on both randomly generated and NCBI genomic data show that whole-genome based selection results in a number of distinguishers nearly matching the information theoretic lower bounds for the problem.

Affiliated with

Also associated with

No associations

Rating

Highly Scalable Algorithms for Robust String Barcoding does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Highly Scalable Algorithms for Robust String Barcoding, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Highly Scalable Algorithms for Robust String Barcoding will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-242519