Diletter circular codes over finite alphabets

DOI10.1016/j.mbs.2017.10.001zbMath1382.92053OpenAlexW2762617464WikidataQ47653130 ScholiaQ47653130MaRDI QIDQ680445

Elena Fimmel, Christian J. Michel, Lutz H. Strüngmann

Publication date: 23 January 2018

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mbs.2017.10.001

zbMATH Keywords

finite alphabetenumerative combinatoricsdiletter circular code

Mathematics Subject Classification ID

Neural biology (92C20) Protein sequences, DNA sequences (92D20) Algorithms on strings (68W32)

Related Items (4)

Circular tessera codes in the evolution of the genetic code ⋮ The relation between \(k\)-circularity and circularity of codes ⋮ Unnamed Item ⋮ Mixed circular codes

Uses Software

• DISTAN

Cites Work

• Maximal dinucleotide and trinucleotide circular codes
• Maximal dinucleotide comma-free codes
• Dinucleotide circular codes
• The maximal \(C^3\) self-complementary trinucleotide circular code \(X\) in genes of bacteria, eukaryotes, plasmids and viruses
• Dinucleotide circular codes and bijective transformations
• Varieties of comma-free codes
• An evolutionary analytical model of a complementary circular code simulating the protein coding genes, the \(5'\) and \(3'\) regions
• A stochastic model of gene evolution with chaotic mutations
• Circular code motifs in transfer and 16S ribosomal RNAs: a possible translation code in genes
• n -Nucleotide circular codes in graph theory
• Comma-Free Codes
• Unnamed Item

This page was built for publication: Diletter circular codes over finite alphabets