Discover Community Create You

Loading publication...

Noodle always counts identifier-free feature events for service operation. With your permission, Google Analytics can also estimate audience and engagement. Search text, publication identifiers, cookies, IP addresses and browser fingerprints are never included in Noodle's first-party event counters.

Privacy details

Article

Pareto Optimization of Combinatorial Mutagenesis Libraries.

IEEE/ACM transactions on computational biology and bioinformatics - 1 Jan 2000

Verma Deeptak, Grigoryan Gevorg, Bailey-Kellogg Chris

Abstract excerpt

In order to increase the hit rate of discovering diverse, beneficial protein variants via high-throughput screening, we have developed a computational method to optimize combinatorial mutagenesis libraries for overall enrichment in two distinct properties of interest. Given scoring functions for evaluating individual variants, POCoM (Pareto Optimal Combinatorial Mutagenesis) scores entire libraries in terms of...

Read the complete abstract on PubMed

Topics

Share this publication in a Topic to start or enrich a Post.

Share to beta-Lactamases
Share to Cytochrome P-450 Enzyme System
Share to Gene Library

Methodology Data sources Editorial policy Privacy About Contact Helena Bioinformatics

Share to Green Fluorescent Proteins

Share to Oligonucleotides

Share to Programming Languages

Share to Protein Engineering

Share to Software

Source

Open in PubMed Open full text

Identifiers

PMID: 30040654
DOI: 10.1109/TCBB.2018.2858794
PMCID: PMC8262366

Provenance

PubMed metadata and Literature Corpus relationships. Corpus snapshot updated 7 Sept 2026. Manifest publication-graph-cohort-2026-09-07.1.

Source receipt: pubmed, retrieved 7 Sept 2026.

Related research

Semantic proximity does not establish scientific evidence.

Research trail→

Click a neighbor to travelStep 1 · 12 closest

Pareto Optimization of Combinatorial Mutagenesis Libraries.PMID 30040654Read ↗

Optimization of combinatorial mutagenesis.Semantic proximity Read ↗

Designed active-site library reveals thousands of functional GFP variants.Semantic proximity Read ↗

Resistor: an algorithm for predicting resistance mutations using Pareto optimization over multistate protein design and mutational signaturesSemantic proximity Read ↗

Complete combinatorial mutational enumeration of a protein functional site enables sequence-landscape mapping and identifies highly-mutated variants that retain activity.Semantic proximity Read ↗

Resistor: An algorithm for predicting resistance mutations via Pareto optimization over multistate protein design and mutational signatures.Semantic proximity Read ↗

Statistical Coupling Analysis-Guided Library Design for the Discovery of Mutant Luciferases.Semantic proximity Read ↗

ACIDES: on-line monitoring of forward genetic screens for protein engineering.Semantic proximity Read ↗

"Multiagent" Screening Improves Directed Enzyme Evolution by Identifying Epistatic Mutations.Semantic proximity Read ↗

Informed training set design enables efficient machine learning-assisted directed protein evolution.Semantic proximity Read ↗

Learning protein fitness landscapes with deep mutational scanning data from multiple sources.Semantic proximity Read ↗

A top variant identification pipeline for protein engineering.Semantic proximity Read ↗

Accurate top protein variant discovery via low-N pick-and-validate machine learning.Semantic proximity Read ↗

⌁Select a neighboring publication to make it the new centre.