Knockout Sudoku is a method for the construction of whole-genome knockout collections for a wide range of microorganisms with as little as 3 weeks of dedicated labor and at a cost of ∼$10,000 for a collection for a single organism. The method uses manual 4D combinatorial pooling, next-generation sequencing, and a Bayesian inference algorithm to rapidly process and then accurately annotate the extremely large progenitor transposon insertion mutant collections needed to achieve saturating coverage of complex microbial genomes. This method is ∼100× faster and 30× lower in cost than the next comparable method (In-seq) for annotating transposon mutant collections by combinatorial pooling and next-generation sequencing. This method facilitates the rapid, algorithmically guided condensation and curation of the progenitor collection into a high-quality, nonredundant collection that is suitable for rapid genetic screening and gene discovery.

中文翻译：

---

使用Knockout Sudoku快速管理基因破坏集合。

Knockout Sudoku是一种构建多种基因组的全基因组基因敲除收集物的方法，只需花费3周的专心工作，单个生物收集的费用约为10,000美元。该方法使用手动4D组合合并，下一代测序和贝叶斯推理算法来快速处理，然后准确注释实现复杂微生物基因组饱和覆盖所需的超大祖细胞转座子插入突变体集合。与通过组合合并和下一代测序注释转座子突变体集合的下一个类似方法（In-seq）相比，该方法的速度快约100倍，成本降低30倍。这种方法有助于将祖先收集物快速，通过算法引导进行冷凝和处理，以使其成为高质量的