Diletter circular codes over finite alphabets
From MaRDI portal
Publication:680445
DOI10.1016/J.MBS.2017.10.001zbMATH Open1382.92053OpenAlexW2762617464WikidataQ47653130 ScholiaQ47653130MaRDI QIDQ680445FDOQ680445
Authors: E. Fimmel, Christian J. Michel, Lutz 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Circular code motifs in transfer and 16S ribosomal RNAs: a possible translation code in genes
- Maximal dinucleotide and trinucleotide circular codes
- Maximal dinucleotide comma-free codes
- 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
- n -Nucleotide circular codes in graph theory
Cited In (6)
Uses Software
This page was built for publication: Diletter circular codes over finite alphabets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q680445)
