Dataset Information

Improved bacterial recombineering by parallelized protein discovery.

ABSTRACT: Exploiting bacteriophage-derived homologous recombination processes has enabled precise, multiplex editing of microbial genomes and the construction of billions of customized genetic variants in a single day. The techniques that enable this, multiplex automated genome engineering (MAGE) and directed evolution with random genomic mutations (DIvERGE), are however, currently limited to a handful of microorganisms for which single-stranded DNA-annealing proteins (SSAPs) that promote efficient recombineering have been identified. Thus, to enable genome-scale engineering in new hosts, efficient SSAPs must first be found. Here we introduce a high-throughput method for SSAP discovery that we call "serial enrichment for efficient recombineering" (SEER). By performing SEER in Escherichia coli to screen hundreds of putative SSAPs, we identify highly active variants PapRecT and CspRecT. CspRecT increases the efficiency of single-locus editing to as high as 50% and improves multiplex editing by 5- to 10-fold in E. coli, while PapRecT enables efficient recombineering in Pseudomonas aeruginosa, a concerning human pathogen. CspRecT and PapRecT are also active in other, clinically and biotechnologically relevant enterobacteria. We envision that the deployment of SEER in new species will pave the way toward pooled interrogation of genotype-to-phenotype relationships in previously intractable bacteria.

SUBMITTER: Wannier TM

PROVIDER: S-EPMC7306799 | biostudies-literature | 2020 Jun

REPOSITORIES: biostudies-literature

ACCESS DATA

Publications

Improved bacterial recombineering by parallelized protein discovery.

Wannier Timothy M TM Nyerges Akos A Kuchwara Helene M HM Czikkely Márton M Balogh Dávid D Filsinger Gabriel T GT Borders Nathaniel C NC Gregg Christopher J CJ Lajoie Marc J MJ Rios Xavier X Pál Csaba C Church George M GM Church George M GM

Proceedings of the National Academy of Sciences of the United States of America 20200528 24

Exploiting bacteriophage-derived homologous recombination processes has enabled precise, multiplex editing of microbial genomes and the construction of billions of customized genetic variants in a single day. The techniques that enable this, multiplex automated genome engineering (MAGE) and directed evolution with random genomic mutations (DIvERGE), are however, currently limited to a handful of microorganisms for which single-stranded DNA-annealing proteins (SSAPs) that promote efficient recomb ...[more]

PMID: 32467157

Similar Datasets

Project description:BackgroundAn important step in annotation of sequenced genomes is the identification of transcription factor binding sites. More than a hundred different computational methods have been proposed, and it is difficult to make an informed choice. Therefore, robust assessment of motif discovery methods becomes important, both for validation of existing tools and for identification of promising directions for future research.ResultsWe use a machine learning perspective to analyze collections of transcription factors with known binding sites. Algorithms are presented for finding position weight matrices (PWMs), IUPAC-type motifs and mismatch motifs with optimal discrimination of binding sites from remaining sequence. We show that for many data sets in a recently proposed benchmark suite for motif discovery, none of the common motif models can accurately discriminate the binding sites from remaining sequence. This may obscure the distinction between the potential performance of the motif discovery tool itself versus the intrinsic complexity of the problem we are trying to solve. Synthetic data sets may avoid this problem, but we show on some previously proposed benchmarks that there may be a strong bias towards a presupposed motif model. We also propose a new approach to benchmark data set construction. This approach is based on collections of binding site fragments that are ranked according to the optimal level of discrimination achieved with our algorithms. This allows us to select subsets with specific properties. We present one benchmark suite with data sets that allow good discrimination between positive and negative instances with the common motif models. These data sets are suitable for evaluating algorithms for motif discovery that rely on these models. We present another benchmark suite where PWM, IUPAC and mismatch motif models are not able to discriminate reliably between positive and negative instances. This suite could be used for evaluating more powerful motif models.ConclusionOur improved benchmark suites have been designed to differentiate between the performance of motif discovery algorithms and the power of motif models. We provide a web server where users can download our benchmark suites, submit predictions and visualize scores on the benchmarks.

Dataset Information

Improved bacterial recombineering by parallelized protein discovery.

Publications

Improved bacterial recombineering by parallelized protein discovery.

Similar Datasets

OmicsDI is part of the ELIXIR infrastructure

Tweets