Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Optimization Problems01:26

Optimization Problems

197
Optimization problems often involve identifying maximum or minimum values under specific constraints. A well-known example is determining the longest horizontal pipe that can be moved around a right-angled corner, where a 3-meter-wide hallway meets a 2-meter-wide hallway. This scenario, common in architectural design and industrial transport, can be understood conceptually through geometric and trigonometric reasoning.To visualize the problem, consider the pipe as a straight line that touches...
197
Methods of Medium Optimization01:28

Methods of Medium Optimization

63
Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...
63
Improving Translational Accuracy02:07

Improving Translational Accuracy

15.7K
Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
15.7K
Improving Translational Accuracy02:07

Improving Translational Accuracy

3.8K
3.8K
From DNA to Protein03:06

From DNA to Protein

25.0K
The flow of genetic information in cells from DNA to mRNA to protein is described by the central dogma, which states that genes specify the sequence of mRNAs, which in turn specify the sequence of amino acids making up all proteins. The decoding of one molecule to another is performed by specific proteins and RNAs. Because the information stored in DNA is so central to cellular function, it makes intuitive sense that the cell would make mRNA copies of this information for protein synthesis...
25.0K
Gene Evolution - Fast or Slow?02:05

Gene Evolution - Fast or Slow?

3.8K
3.8K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Deep learning based design of buried hydrogen bond networks with HBDesigner.

bioRxiv : the preprint server for biology·2026
Same author

De novo masking domains that gate TNF-family ligand assembly and activity.

bioRxiv : the preprint server for biology·2026
Same author

Intensity modulation of trichromatic split fluorescent proteins for live cell mapping.

Cell reports methods·2026
Same author

Enhancing Enzymatic Bioconjugation Efficiency via Computer-Based Installation of a Substrate Recruitment Domain.

Bioconjugate chemistry·2026
Same author

Enhancing ML-based binder design with high-throughput screening: a comparison of mRNA and yeast display technologies.

bioRxiv : the preprint server for biology·2026
Same author

De novo design of protein binders that target DELE1 to inhibit the mitochondrial stress response.

bioRxiv : the preprint server for biology·2026
Same journal

Correction to 'New origin firing is inhibited by APC/CCdh1 activation in S-phase after severe replication stress'.

Nucleic acids research·2026
Same journal

VeloRM: disentangling pre- and post-splicing RNA modification dynamics at single-cell resolution.

Nucleic acids research·2026
Same journal

Accessibility of telomeric overhangs to stabilizing small-molecule ligands.

Nucleic acids research·2026
Same journal

Multivalent interactions mediate SNAIL transcription factor stimulation of the nucleosome deacetylase activity of the CoREST complex.

Nucleic acids research·2026
Same journal

Genome-wide mapping of DNA G-quadruplexes in Trypanosoma brucei chromatin reveals enrichment in coding regions and transcription start sites.

Nucleic acids research·2026
Same journal

Correction to 'The Gene Ontology knowledgebase in 2026'.

Nucleic acids research·2026
See all related articles

Related Experiment Video

Updated: Apr 19, 2026

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

7.8K

SwiftLib: rapid degenerate-codon-library optimization through dynamic programming.

Timothy M Jacobs1, Hayretin Yumerefendi1, Brian Kuhlman2

  • 1Department of Biochemistry, University of North Carolina at Chapel Hill, Chapel Hill, NC 27599, USA.

Nucleic Acids Research
|December 26, 2014
PubMed
Summary
This summary is machine-generated.

This study presents a new dynamic programming algorithm for designing degenerate codon (DC) libraries, overcoming manual construction challenges. The method efficiently creates diverse libraries within size limits for directed evolution.

More Related Videos

A Protocol for Functional Assessment of Whole-Protein Saturation Mutagenesis Libraries Utilizing High-Throughput Sequencing
11:36

A Protocol for Functional Assessment of Whole-Protein Saturation Mutagenesis Libraries Utilizing High-Throughput Sequencing

Published on: July 3, 2016

11.4K
Directed Evolution Method in Saccharomyces cerevisiae: Mutant Library Creation and Screening
10:50

Directed Evolution Method in Saccharomyces cerevisiae: Mutant Library Creation and Screening

Published on: April 1, 2016

11.5K

Related Experiment Videos

Last Updated: Apr 19, 2026

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues
07:08

Optimization of Synthetic Proteins: Identification of Interpositional Dependencies Indicating Structurally and/or Functionally Linked Residues

Published on: July 14, 2015

7.8K
A Protocol for Functional Assessment of Whole-Protein Saturation Mutagenesis Libraries Utilizing High-Throughput Sequencing
11:36

A Protocol for Functional Assessment of Whole-Protein Saturation Mutagenesis Libraries Utilizing High-Throughput Sequencing

Published on: July 3, 2016

11.4K
Directed Evolution Method in Saccharomyces cerevisiae: Mutant Library Creation and Screening
10:50

Directed Evolution Method in Saccharomyces cerevisiae: Mutant Library Creation and Screening

Published on: April 1, 2016

11.5K

Area of Science:

  • Biotechnology
  • Molecular Biology
  • Bioinformatics

Background:

  • Directed evolution requires large libraries, but experimental size limits pose a challenge.
  • Manual construction of degenerate codon (DC) libraries is complex, time-consuming, and error-prone.
  • Existing methods for DC library design have limitations in efficiency and scope.

Purpose of the Study:

  • To develop an efficient algorithm for designing optimal DC libraries within experimental size constraints.
  • To extend DC library design to incorporate multiple DCs per position while managing primer synthesis.
  • To improve upon existing integer-linear programming formulations for DC library construction.

Main Methods:

  • Developed a dynamic programming algorithm to find optimal DC libraries under size limitations.
  • Extended the algorithm to handle multiple DCs per codon position and primer number constraints.
  • Evaluated the algorithm on two library design problems.

Main Results:

  • The dynamic programming approach significantly improves upon existing methods for DC library design.
  • The extended algorithm successfully incorporates multiple DCs per position, a previously unsolved problem.
  • Achieved near-complete coverage of desired amino acids within experimental library size limits.
  • Demonstrated the ability to generate libraries with a nucleic acid to amino acid sequence ratio approaching 1, mitigating genetic code degeneracy.
  • The algorithm solves most design problems rapidly, typically within one second.

Conclusions:

  • The novel dynamic programming algorithm provides an efficient and accurate solution for designing DC libraries for directed evolution.
  • The ability to use multiple DCs per position expands the utility of DC libraries and addresses a key limitation.
  • The algorithm effectively balances library diversity with experimental constraints, leading to high-quality libraries.
  • The computational tool is freely available, facilitating broader adoption in protein engineering and synthetic biology.