Unknown

Dataset Information

0

SwiftLib: rapid degenerate-codon-library optimization through dynamic programming.


ABSTRACT: 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.

SUBMITTER: Jacobs TM 

PROVIDER: S-EPMC4357694 | biostudies-literature | 2015 Mar

REPOSITORIES: biostudies-literature

altmetric image

Publications

SwiftLib: rapid degenerate-codon-library optimization through dynamic programming.

Jacobs Timothy M TM   Yumerefendi Hayretin H   Kuhlman Brian B   Leaver-Fay Andrew A  

Nucleic acids research 20141224 5


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  ...[more]

Similar Datasets

| S-EPMC7358382 | biostudies-literature
| S-EPMC9333297 | biostudies-literature
| S-EPMC7267834 | biostudies-literature
| S-EPMC5870680 | biostudies-literature
| S-EPMC4308990 | biostudies-literature
| S-EPMC4908505 | biostudies-literature
| S-EPMC3715551 | biostudies-literature
2015-06-04 | E-GEOD-67387 | biostudies-arrayexpress
2019-05-17 | GSE123611 | GEO
| S-EPMC4000823 | biostudies-literature