Dinucleotide circular codes (Q355961)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6191293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dinucleotide circular codes |
scientific article; zbMATH DE number 6191293 |
Statements
Dinucleotide circular codes (English)
0 references
25 July 2013
0 references
Summary: We begin here a combinatorial study of dinucleotide circular codes. A word written on a circle is called circular. A set of dinucleotides is a circular code if all circular words constructed with this set have a unique decomposition. Propositions based on a letter necklace allow to determine the 24 maximum dinucleotide circular codes (of 6 elements). A partition property is also identified with eight self-complementary maximum dinucleotide circular codes and two classes of eight maximum dinucleotide circular codes in bijective correspondence by the complementarity map.
0 references
0.9042593836784364
0 references
0.859529972076416
0 references
0.835545539855957
0 references
