Skip Navigation

This Article
Right arrow Full Text Freely available
Right arrow Print PDF (1086K) Freely available
Right arrow Supplementary Material
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (7)
Right arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Moore, G. L.
Right arrow Articles by Maranas, C. D.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Moore, G. L.
Right arrow Articles by Maranas, C. D.
Related Collections
Right arrow Computational methods
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2002, Vol. 30, No. 11 2407-2416
© 2002 Oxford University Press

eCodonOpt: a systematic computational framework for optimizing codon usage in directed evolution experiments

Gregory L. Moore and Costas D. Maranas*

Department of Chemical Engineering, The Pennsylvania State University, 112 Fenske Laboratory, University Park, PA 16802, USA

We present a systematic computational framework, eCodonOpt, for designing parental DNA sequences for directed evolution experiments through codon usage optimization. Given a set of homologous parental proteins to be recombined at the DNA level, the optimal DNA sequences encoding these proteins are sought for a given diversity objective. We find that the free energy of annealing between the recombining DNA sequences is a much better descriptor of the extent of crossover formation than sequence identity. Three different diversity targets are investigated for the DNA shuffling protocol to showcase the utility of the eCodonOpt framework: (i) maximizing the average number of crossovers per recombined sequence; (ii) minimizing bias in family DNA shuffling so that each of the parental sequence pair contributes a similar number of crossovers to the library; and (iii) maximizing the relative frequency of crossovers in specific structural regions. Each one of these design challenges is formulated as a constrained optimization problem that utilizes 0–1 binary variables as on/off switches to model the selection of different codon choices for each residue position. Computational results suggest that many-fold improvements in the crossover frequency, location and specificity are possible, providing valuable insights for the engineering of directed evolution protocols.

* To whom correspondence should be addressed. Tel: +1 814 863 9958; Fax: +1 814 865 7846; Email: costas{at}psu.edu


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
 Protein Eng Des SelHome page
J. B. Endelman, J. J. Silberg, Z.-G. Wang, and F. H. Arnold
Site-directed protein recombination as a shortest-path problem
Protein Eng. Des. Sel., July 1, 2004; 17(7): 589 - 594.
[Abstract] [Full Text] [PDF]

Home page
 Nucleic Acids ResHome page
C. Neylon
Chemical and biochemical strategies for the randomization of protein encoding DNA sequences: library construction methods for directed evolution
Nucleic Acids Res., February 27, 2004; 32(4): 1448 - 1459.
[Abstract] [Full Text] [PDF]

Home page
 Protein Eng Des SelHome page
W. M. Patrick, A. E. Firth, and J. M. Blackburn
User-friendly algorithms for estimating completeness and diversity in randomized protein-encoding libraries
Protein Eng. Des. Sel., June 1, 2003; 16(6): 451 - 457.
[Abstract] [Full Text] [PDF]


Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.