title: Optimal scanning of all single-point mutants of a protein.
abstract: In protein engineering, useful information may be gained from systematically generating and screening all single-point mutants of a given protein. We model and analyze an iterative two-stage procedure to generate all these mutants. At each position, L variants are generated in the first stage via saturation mutagenesis and are sequenced. In the second stage, the missing variants (out of the 19 possible single-point substitutions) are produced via site-directed mutagenesis. We study the economic tradeoff associated with varying L, and derive its optimal value given the experimental parameters.
authors.affiliation: 1 Department of Statistics, University of Haifa , Haifa, Israel .
authors.forename: Yuval
authors.initials: Y
authors.lastname: Nov
authors.forename: Alexander
authors.initials: A
authors.lastname: Fulton
authors.forename: Karl-Erich
authors.initials: KE
authors.lastname: Jaeger
mesh_terms: D000465:Algorithms; D000818:Animals; D006801:Humans; D016297:Mutagenesis, Site-Directed; D009154:Mutation / Q000235:genetics*; D015202:Protein Engineering; D011506:Proteins / Q000235:genetics*
chemical_list: D011506:Proteins