Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Improving Translational Accuracy

Improving Translational Accuracy

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...

Improving Translational Accuracy

Improving Translational Accuracy

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...

Genome Copying Errors

Genome Copying Errors

DNA replication is a well-evolved process that copies millions of base pairs with high fidelity during each cell division. Occasionally a wrong base or a long stretch of wrong bases may get added to the daughter strands. If the errors are left unchecked, cells might accumulate several mutations that might endanger their survival. Therefore, the copying errors are checked and repaired at three levels.

From DNA to Protein

From DNA to Protein

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...

The Central Dogma

The Central Dogma

The central dogma explains the flow of genetic information from DNA nucleotides to the amino acid sequence of proteins.
RNA is the Missing Link Between DNA and Proteins
In the early 1900s, scientists discovered that DNA stores all the information needed for cellular functions and that proteins perform most of these functions. However, the mechanisms of converting genetic information into functional proteins remained unknown for many years. Initially, it was believed that a single gene is...

The Central Dogma

The Central Dogma

You might also read

Related Articles

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

Sort by

Same author

Provable and Verifiable Quantum Advantage in Sample Complexity.

Physical review letters·2026

Same author

Making Existing Quantum Position Verification Protocols Secure Against Arbitrary Transmission Loss.

Physical review letters·2026

Same author

Natural and artificial variations of the standard genetic code.

Current biology : CB·2025

Same author

Beating the Natural Grover Bound for Low-Energy Estimation and State Preparation.

Physical review letters·2025

Same author

The Evolution and Implications of the Inosine tRNA Modification.

Journal of molecular biology·2025

Same author

Missing value replacement in strings and applications.

Data mining and knowledge discovery·2025

Same journal

circ2DGNN: circRNA-Disease Association Prediction via Transformer-Based Graph Neural Network.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

Hierarchical Hypergraph Learning in Association- Weighted Heterogeneous Network for miRNA- Disease Association Identification.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

Discriminative Domain Adaption Network for Simultaneously Removing Batch Effects and Annotating Cell Types in Single-Cell RNA-Seq.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

MLW-BFECF: A Multi-Weighted Dynamic Cascade Forest Based on Bilinear Feature Extraction for Predicting the Stage of Kidney Renal Clear Cell Carcinoma on Multi-Modal Gene Data.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

An End-to-End Knowledge Graph Fused Graph Neural Network for Accurate Protein-Protein Interactions Prediction.

IEEE/ACM transactions on computational biology and bioinformatics·2024

Same journal

Generative Biomedical Event Extraction With Constrained Decoding Strategy.

IEEE/ACM transactions on computational biology and bioinformatics·2024

See all related articles

Search research articles

Related Experiment Video

Updated: Jun 4, 2026

A Facile Protocol to Generate Site-Specifically Acetylated Proteins in Escherichia Coli

A Facile Protocol to Generate Site-Specifically Acetylated Proteins in Escherichia Coli

Published on: December 9, 2017

Some mathematical refinements concerning error minimization in the genetic code.

Harry Buhrman¹, Peter T S van der Gulik, Steven M Kelk

¹Centrum voor Wiskunde en Informatica, PO Box 94079, NL-1090 GB Amsterdam, The Netherlands. harry.buhrman@cwi.nl

IEEE/ACM Transactions on Computational Biology and Bioinformatics

|March 2, 2011

Summary

This summary is machine-generated.

The genetic code demonstrates significant error robustness, surpassing random codes. This study confirms a previously found heuristic code as the global optimum, using a Quadratic Assignment Problem formulation.

More Related Videos

Rare Event Detection Using Error-corrected DNA and RNA Sequencing

Rare Event Detection Using Error-corrected DNA and RNA Sequencing

Published on: August 3, 2018

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans

Published on: August 16, 2017

Related Experiment Videos

Last Updated: Jun 4, 2026

A Facile Protocol to Generate Site-Specifically Acetylated Proteins in Escherichia Coli

A Facile Protocol to Generate Site-Specifically Acetylated Proteins in Escherichia Coli

Published on: December 9, 2017

Rare Event Detection Using Error-corrected DNA and RNA Sequencing

Rare Event Detection Using Error-corrected DNA and RNA Sequencing

Published on: August 3, 2018

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans

Quantification of Information Encoded by Gene Expression Levels During Lifespan Modulation Under Broad-range Dietary Restriction in C. elegans

Published on: August 16, 2017

Area of Science:

Biochemistry
Evolutionary Biology
Computational Biology

Background:

The genetic code exhibits inherent error robustness.
Previous comparisons showed it less robust than a heuristically derived code.
The search space for random codes was previously limited.

Purpose of the Study:

To formally verify the global optimum of a heuristically derived genetic code.
To re-evaluate the genetic code's error robustness within a vastly expanded code space.
To investigate the implications of code space size on error minimization comparisons.

Main Methods:

Formulating the genetic code optimization as a Quadratic Assignment Problem.
Expanding the random code sampling space by incorporating wobble rules.
Relaxing constraints to construct even larger code spaces.
Employing a modified error function for robustness assessment.

Main Results:

The heuristic algorithm's code was confirmed as the global optimum.
The genetic code is significantly more error robust than random codes across expanded search spaces.
Increasing the size of the random code space enhances the observed robustness of the genetic code.

Conclusions:

The genetic code's error robustness is substantial, even when compared to a much larger set of possible codes.
The findings challenge previous comparisons based on limited code spaces.
Error robustness may not solely be a result of optimization for error minimization during evolution.