When Second Best Is Good Enough: Another Probabilistic Look at Saturation Mutagenesis
Author(s) -
Yuval Nov
Publication year - 2011
Publication title -
applied and environmental microbiology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.552
H-Index - 324
eISSN - 1070-6291
pISSN - 0099-2240
DOI - 10.1128/aem.06265-11
Subject(s) - saturated mutagenesis , probabilistic logic , saturation (graph theory) , computational biology , genetics , mutagenesis , biology , computer science , biological system , mutation , mathematics , artificial intelligence , mutant , gene , combinatorics
We developed new criteria for determining the library size in a saturation mutagenesis experiment. When the number of all possible distinct variants is large, any of the top-performing variants (e.g., any of the top three) is likely to meet the design requirements, so the probability that the library contains at least one of them is a sensible criterion for determining the library size. By using a criterion of this type, one may significantly reduce the library size and thus save costs and labor while minimally compromising the quality of the best variant discovered. We present the probabilistic tools underlying these criteria and use them to compare the efficiencies of four randomization schemes: NNN, which uses all 64 codons; NNB, which uses 48 codons; NNK, which uses 32 codons; and MAX, which assigns equal probabilities to each of the 20 amino acids. MAX was found to be the most efficient randomization scheme and NNN the least efficient. TopLib, a computer program for carrying out the related calculations, is available through a user-friendly Web server.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom