TopLib computes the library size required to achieve a chosen probability of certain events, in a saturation mutagenesis experiment: the user specifies the desired probability (typically a number close to 1), the event of interest, and the randomization scheme (how many positions are randomized and how), and TopLib computes the number of variants that need to be screened. TopLib can also run the the inverse computation, and report the probability of the event of interest, given a library size specified by the user.
The methods behind TopLib are described in the paper "When second best is good enough: another probabilistic look at saturation mutagenesis" by Yuval Nov (AEM 2012). For a short user manual, click here.
To report bugs, suggest improvements, or provide feedback, contact me.