ORF-selector ESPRIT: a second generation library screen for soluble protein expression employing precise open reading frame selection

Here we present ORF-selector ESPRIT, a 9-fold enhanced version of our technology for screening incremental truncation libraries to identify soluble high yielding constructs of challenging proteins. Gene fragments are truncated at both termini to access internal domains and the resulting reading frame problem is addressed by an unbiased, intein-based open reading frame selection yielding only in-frame DNA inserts. This enriched library is then subcloned into a standard high-level expression plasmid where tens of thousands of constructs can be assayed in a two-step process using colony- and liquid-handling robots to isolate rare highly expressing clones useful for production of multi milligram quantities of purifiable proteins. The p85α protein was used to benchmark the system resulting in isolation of all known domains, either alone or in tandem. The human kinase IKK1 was then screened resulting in purification of a predicted internal domain. This strategy provides an integrated, facile route to produce soluble proteins from challenging and poorly understood target genes at quantities compatible with structural biology, screening applications and immunisation studies. The high genetic diversity that can be sampled opens the way to study more diverse systems including multisubunit complexes.     

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

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.     

Library-based methods for identification of soluble expression constructs

When expression or crystallisation of a protein target in its wild-type full-length form proves problematic, a common strategy is to divide it into subconstructs comprising one or more domains. Rational construct design is not always successful, especially with targets for which there are few similar sequences to generate multiple sequence alignments. Even when this is possible, expression constructs may still fail to yield soluble protein, commonly expressing insolubly or at unusable yields. To address this, several new methods have been described that borrow concepts from the field of directed evolution whereby a random library is generated encompassing construct diversity; this is then screened to identify soluble constructs empirically. Here, we review progress in this area.