高度可扩展的鲁棒字符串条形码算法
Highly Scalable Algorithms for Robust String Barcoding
摘要：
字符串条形码是最近引入的用于基于基因组的微生物鉴定的技术。在本文中，我们描述了工程的高度可扩展的算法，强大的字符串条码。我们的方法能够在设备齐全的工作站上基于数百种微生物的全基因组序列进行细菌选择，并且可以很容易地并行化，以进一步将适用范围扩展到数千种细菌大小的基因组。随机生成的和NCBI的基因组数据的实验结果表明，全基因组为基础的选择结果在一些几乎匹配的问题的信息理论的下限。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
