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

Second Uniqueness Theorem01:16

Second Uniqueness Theorem

2.6K
Consider a region consisting of several individual conductors with a definite charge density in the region between these conductors. The second uniqueness theorem states that if the total charge on each conductor and the charge density in the in-between region are known, then the electric field can be uniquely determined.
In contrast, consider that the electric field is non-unique and apply Gauss's law in divergence form in the region between the conductors and the integral form to the surface...
2.6K
Principle of Equivalence01:18

Principle of Equivalence

2.5K
According to Albert Einstein (1897-1955), free-falling and feeling weightless are intrinsically linked. If a person were in free-fall under gravity, for example, diving towards the Earth from an airplane, they would feel completely weightless. Similarly, a person descending in a lift may feel partially weightless. Broadly speaking, it is assumed that an object in a uniform gravitational field and an object undergoing constant acceleration in the absence of gravity are under the same...
2.5K
Fundamental Theorem of Algebra01:30

Fundamental Theorem of Algebra

209
The Fundamental Theorem of Algebra is central to the study of polynomial equations, asserting that every non-constant polynomial with complex coefficients has at least one complex zero. This means that a polynomial of degree n ≥ 1, written as:  with an ≠ 0, has at least one solution in the complex number system. Since the set of real numbers is a subset of complex numbers, this theorem applies equally to polynomials with real coefficients.Building on this result, the...
209
Stereoisomerism02:52

Stereoisomerism

13.8K
Isomerism in Complexes
Isomers are different chemical species that have the same chemical formula.
Transition metal complexes often exist as geometric isomers, in which the same atoms are connected through the same types of bonds but with differences in their orientation in space. Coordination complexes with two different ligands in the cis and trans positions from a ligand of interest form isomers. For example, the octahedral [Co(NH3)4Cl2]+ ion has two isomers (Figure 1) In the cis...
13.8K
Maxam-Gilbert Sequencing01:05

Maxam-Gilbert Sequencing

12.6K
In the same year as the discovery of the Sanger sequencing method, another group of scientists, Allan Maxam and Walter Gilbert, demonstrated their chemical-cleavage method for DNA sequencing. The Maxam-Gilbert method relies on using different chemicals that can cleave the DNA sequence at specific sites, the separation of resulting DNA fragments of variable size using electrophoresis, and deciphering the DNA sequence from the resulting gel bands.
Challenges of the Maxam-Gilbert Method
The...
12.6K
The Maximum Power Transfer Theorem01:20

The Maximum Power Transfer Theorem

1.1K
Consider a linear AC Thevenin equivalent circuit connected to a load impedance.
The load connected draws the current, and the circuit delivers the power to the load. The alternating current flowing through the load is determined using the rectangular form of voltages, currents, network impedance, and load impedance. The average power delivered to the load is obtained from the product of the square of current and load resistance.
1.1K

You might also read

Related Articles

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

Sort by
Same author

Construction of Dinucleotide Circular Codes Based on Nucleotide Probabilities.

Acta biotheoretica·2025
Same author

Codes across (life)sciences.

Bio Systems·2025
Same author

Enhancing FAIRdata by providing digital workflows from data generation to the publication of data: an open source approach described for cyclic voltammetry.

Chemical science·2025
Same author

Forbidden codon combinations in error-detecting circular codes.

Theory in biosciences = Theorie in den Biowissenschaften·2024
Same author

Circular cut codes in genetic information.

Bio Systems·2024
Same author

The spiderweb of error-detecting codes in the genetic information.

Bio Systems·2023
Same journal

Permanent Scaffolding of Social Expertise.

Acta biotheoretica·2026
Same journal

Who infects whom in an epidemic?

Acta biotheoretica·2026
Same journal

A Discrete Dynamical System Approach for Modeling Wolbachia Infection in Dioecious Populations.

Acta biotheoretica·2026
Same journal

Correction: The Emergence of Turing Instability and Pattern Formation in a Nonlinear Stochastic Spatiotemporal Epidemic Model with Reinfections.

Acta biotheoretica·2026
Same journal

Allele Frequency Spectra as a General Tool for Modeling Genetic Diversity.

Acta biotheoretica·2026
Same journal

Metabolic Scaling from Fibonacci Dynamics.

Acta biotheoretica·2026
See all related articles

Related Experiment Video

Updated: Jan 11, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.5K

Isomorphisms of Maximal Self-complementary [Formula: see text]-codes.

Christoph Begall1, Lutz Strüngmann2, Martin Starman1

  • 1Associated to Competence Center in Medicine, Biology, and Biotechnology, Technical University of Mannheim, Mannheim, 68163, Mannheim, Germany.

Acta Biotheoretica
|November 17, 2025
PubMed
Summary
This summary is machine-generated.

This study explores graph isomorphisms in genetic codes, revealing unexpected connections beyond established classifications. We found that maximal self-complementary codes from different classes are not isomorphic, clarifying their unique structures.

Keywords:
Automorphism group of graphsCircular codeIsomorphic codesMaximal self-complementary [Formula: see text]-codes

More Related Videos

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.6K
A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference
07:56

A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference

Published on: September 5, 2019

8.9K

Related Experiment Videos

Last Updated: Jan 11, 2026

Generating Strictly Controlled Stimuli for Figure Recognition Experiments
05:39

Generating Strictly Controlled Stimuli for Figure Recognition Experiments

Published on: March 18, 2019

5.5K
Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

9.6K
A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference
07:56

A Photonic System for Generating Unconditional Polarization-Entangled Photons Based on Multiple Quantum Interference

Published on: September 5, 2019

8.9K

Area of Science:

  • Graph theory
  • Bioinformatics
  • Coding theory

Background:

  • Maximal self-complementary [Formula: see text]-codes are crucial for genetic translation.
  • These codes are classified into 27 equivalence classes under dihedral group [Formula: see text] action.
  • Previous work (Fimmel et al., 2016) showed induced graph isomorphisms within these classes.

Purpose of the Study:

  • To investigate graph isomorphisms between maximal self-complementary [Formula: see text]-codes.
  • To determine if graph isomorphisms exist only within the established 27 equivalence classes.
  • To analyze the automorphism groups of the 216 associated graphs.

Main Methods:

  • Calculation of automorphism groups for 216 graphs associated with maximal self-complementary [Formula: see text]-codes.
  • Analysis of graph isomorphism conditions between codes from different equivalence classes.
  • Illustrative examples to demonstrate the necessity of code properties (maximality, self-complementarity, [Formula: see text]-property).

Main Results:

  • Induced isomorphisms from dihedral group [Formula: see text] action are not the sole graph isomorphisms.
  • Automorphism groups of the 216 graphs are largely non-trivial.
  • No graph isomorphisms exist between maximal self-complementary [Formula: see text]-codes belonging to different equivalence classes.

Conclusions:

  • The study reveals graph isomorphisms beyond those predicted by group action on equivalence classes.
  • It confirms the distinctness of codes across different equivalence classes.
  • The importance of maximality, self-complementarity, and the [Formula: see text]-property for these codes is underscored.