Calculation of sequence space coverage in a mutagenesis library

Directed evolution requires screening of large mutagenesis libraries, but accurate calculation of library sizes needed to discover functional variants remains challenging. Existing models provide baseline estimates, yet current computational approaches for finding the best variants scale poorly with library complexity. Here, we introduce a scalable computational framework that overcomes the combinatorial scaling bottlenecks of previous top-k models. By aggregating variants into a composition log-sum distribution and applying log-space convolution across randomisation blocks, we extend coverage estimation to massive sequence spaces and mixed codon schemes. By inverting these calculations, we establish conservative screening upper bounds and practical ceilings on the maximum randomisable positions for experimental design. Ultimately, this framework provides a rapid, quantitative tool to balance the statistical coverage-diversity trade-off within the limitations of laboratory screening. Finally, this is implemented as an open-source web application (SSCC), publicly available at https://florez-alberto.github.io/SSCC/, that allows researchers to construct heterogeneous library designs and compute required sampling depths, coverage probabilities, and absolute randomisation limits.

Authors

Institutions

Publication Details

Journal
PLoS ONE
Published
2026-11-16
DOI
https://doi.org/10.1371/journal.pone.0362864
Primary Topic
Enzyme Catalysis and Immobilization
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Calculation of sequence space coverage in a mutagenesis library

Darren J. Hart, Guido Uguzzoni, Alberto Florez Prada
PLoS ONE
Enzyme Catalysis and Immobilization
article

Calculation of sequence space coverage in a mutagenesis library

Darren J. Hart, Guido Uguzzoni, Alberto Florez Prada
article en

Abstract

Directed evolution requires screening of large mutagenesis libraries, but accurate calculation of library sizes needed to discover functional variants remains challenging. Existing models provide baseline estimates, yet current computational approaches for finding the best variants scale poorly with library complexity. Here, we introduce a scalable computational framework that overcomes the combinatorial scaling bottlenecks of previous top-k models. By aggregating variants into a composition log-sum distribution and applying log-space convolution across randomisation blocks, we extend coverage estimation to massive sequence spaces and mixed codon schemes. By inverting these calculations, we establish conservative screening upper bounds and practical ceilings on the maximum randomisable positions for experimental design. Ultimately, this framework provides a rapid, quantitative tool to balance the statistical coverage-diversity trade-off within the limitations of laboratory screening. Finally, this is implemented as an open-source web application (SSCC), publicly available at https://florez-alberto.github.io/SSCC/, that allows researchers to construct heterogeneous library designs and compute required sampling depths, coverage probabilities, and absolute randomisation limits.

PLoS ONEVol. 21(11)
Centre National de la Recherche Scientifique (FR), Inserm (FR), Commissariat à l'Énergie Atomique et aux Énergies Alternatives (FR), CEA Grenoble (FR), Institut de Recherche Interdisciplinaire de Grenoble (FR), Institut de Biologie Structurale (FR), Laboratoire Biologie à Grande Échelle (FR)
Université Grenoble Alpes, Agence Nationale de la Recherche
Enzyme Catalysis and Immobilization
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon