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 Experiment Videos

Diletter circular codes over finite alphabets.

Elena Fimmel1, Christian J Michel2, Lutz Strüngmann1

  • 1Institute of Mathematical Biology, Faculty for Computer Sciences, University of Applied Sciences 68163 Mannheim, Germany.

Mathematical Biosciences
|October 13, 2017
PubMed
Summary

This study introduces strong comma-free codes, a new class of diletter circular codes. Researchers enumerated these codes and explored their biological implications in genetics and evolution.

Related Concept Videos

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

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

Acta biotheoretica·2025
Same author

Codes across (life)sciences.

Bio Systems·2025
Same author

Forbidden codon combinations in error-detecting circular codes.

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

Modeling the origin, evolution, and functioning of the genetic code.

Bio Systems·2024
Same author

Genome Galaxy Identified by the Circular Code Theory.

Bulletin of mathematical biology·2024

Area of Science:

  • Combinatorics
  • Bioinformatics
  • Coding Theory

Background:

  • Circular codes are essential in understanding genetic information processing.
  • The graph approach provides a novel framework for analyzing circular codes.
  • Diletter circular codes, specifically, have not been extensively studied.

Purpose of the Study:

  • To introduce and characterize a new class of circular codes: strong comma-free codes.
  • To enumerate diletter circular codes over finite alphabets.
  • To analyze the biological and evolutionary implications of dinucleotide circular codes.

Main Methods:

  • Utilizing the graph approach for the detailed study of diletter circular codes.
  • Proving new theorems related to maximal length diletter circular codes.
Keywords:
Diletter circular codeEnumerative combinatoricsFinite alphabet

Related Experiment Videos

  • Enumerating diletter circular codes over finite alphabets for the first time.

    • Main Results:

    • Identification of strong comma-free codes as a new class of circular codes.
    • Characterization of maximal diletter circular code graphs as acyclic tournaments.
    • First-time enumeration of diletter circular codes over finite alphabets.
    • Determination of maximal path lengths in comma-free and strong comma-free code graphs.

    Conclusions:

    • Strong comma-free codes represent a significant addition to the theory of circular codes.
    • The combinatorial properties of diletter circular codes have direct relevance to biological systems.
    • The findings support an evolutionary hypothesis for the emergence of circular codes in genetic sequences.