Optimal scanning of all single-point mutants of a protein

Yuval Nov, Alexander Fulton, Karl Erich Jaeger

Research output: Contribution to journalArticlepeer-review

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.

Original languageEnglish
Pages (from-to)990-997
Number of pages8
JournalJournal of Computational Biology
Volume20
Issue number12
DOIs
StatePublished - 1 Dec 2013

Keywords

  • complete site-saturation mutagenesis
  • optimal scanning
  • protein engineering
  • saturation mutagenesis.

ASJC Scopus subject areas

  • Computational Mathematics
  • Genetics
  • Molecular Biology
  • Computational Theory and Mathematics
  • Modeling and Simulation

Fingerprint

Dive into the research topics of 'Optimal scanning of all single-point mutants of a protein'. Together they form a unique fingerprint.

Cite this