.png){kind=icon}
Return
SwiftLib: rapid degenerate-codon-library optimization through dynamic programming
.png){kind=icon}
OA
AI
DOI：10.1093/nar/gku1323.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Degenerate codon (DC) libraries efficiently address the experimental library-size limitations of directed evolution by focusing diversity toward the positions and toward the amino acids (AAs) that are most likely to generate hits; however, manually constructing DC libraries is challenging, error prone and time consuming. This paper provides a dynamic programming solution to the task of finding the best DCs while keeping the size of the library beneath some given limit, improving on the existing integer-linear programming formulation. It then extends the algorithm to consider multiple DCs at each position, a heretofore unsolved problem, while adhering to a constraint on the number of primers needed to synthesize the library. In the two library-design problems examined here, the use of multiple DCs produces libraries that very nearly cover the set of desired AAs while still staying within the experimental size limits. Surprisingly, the algorithm is able to find near-perfect libraries where the ratio of amino-acid sequences to nucleic-acid sequences approaches 1; it effectively side-steps the degeneracy of the genetic code. Our algorithm is freely available through our web server and solves most design problems in about a second.
Keywords:
FLUORESCENT PROTEINS
COMPUTATIONAL DESIGN
DIRECTED EVOLUTION
GENE LIBRARIES
DIVERSITY
SPECIFICITY
MUTAGENESIS
ALGORITHMS
SEQUENCES
AFFINITY
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
13.1
Papers:
3.6W
Citations:
29.0W
Organization
Cited Papers
ShareSave
ShareSaveOptimizing nucleotide sequence ensembles for combinatorial protein libraries using a genetic algorithm.png)
NUCLEIC ACIDS RESEARCHOAAI
NUCLEIC ACIDS RESEARCHIF13.1
OAAIShareSaveShareSaveShareSave
View more