.png){kind=icon}
返回
Codon Compression Algorithms for Saturation Mutagenesis
.png){kind=icon}
PRE
AI
DOI：10.1021/sb500282v.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Saturation mutagenesis is employed in protein engineering and genome-editing efforts to generate libraries that span amino acid design space. Traditionally, this is accomplished by using degenerate/compressed codons such as NNK (N = A/C/G/T, K = G/T), which covers all amino acids and one stop codon. These solutions suffer from two types of redundancy: (a) different codons for the same amino acid lead to bias, and (b) wild type amino acid is included within the library. These redundancies increase library size and downstream screening efforts. Here, we present a dynamic approach to compress codons for any desired list of amino acids, taking into account codon usage. This results in a unique codon collection for every amino acid to be mutated, with the desired redundancy level. Finally, we demonstrate that this approach can be used to design precise oligo libraries amendable to recombineering and CRISPR-based genome editing to obtain a diverse population with high efficiency.
Keyword:
saturation mutagenesis
library size
codon redundancy
codon usage
genome editing
CRISPR selection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.9
论文数:
3.9K
被引数:
1.2W
机构
引用论文
Recombineering: a homologous recombination-based method of genetic engineering.png)
NATURE PROTOCOLS
OAAI
NATURE PROTOCOLSIF16
OAAI分享收藏One-step inactivation of chromosomal genes in Escherichia coli K-12 using PCR products使用PCR产物一步法灭活大肠杆菌K-12中的染色体基因OAAI
OAAI分享收藏分享收藏Optimizing nucleotide sequence ensembles for combinatorial protein libraries using a genetic algorithmNUCLEIC ACIDS RESEARCHOAAI
NUCLEIC ACIDS RESEARCHIF13.1
OAAI分享收藏
查看更多内容