Dinucleotide circular codes (Q355961): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(6 intermediate revisions by 6 users not shown) | |||
Property / review text | |||
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. | |||
Property / review text: 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. / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 92C40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 68R15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 92-08 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 94A45 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6191293 / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1155/2013/538631 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2030555609 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q58997416 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4430300 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Circular codes and synchronization / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Comma-Free Codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the bound of the synchronization delay of a local automaton / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Generating functions of circular codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Circular codes in archaeal genomes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mutually symmetric and complementary triplets: differences in their use distinguish systematically between coding and non-coding genomic sequences / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Identification of circular codes in bacterial genomes and their use in a factorization method for retrieving the reading frames of genes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Varieties of comma-free codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A relation between trinucleotide comma-free codes and trinucleotide circular codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A hierarchy for circular codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3077343 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Identification of all trinucleotide circular codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3589358 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Strong trinucleotide circular codes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4904051 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Circular codes revisited: a statistical approach / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A classification of 20-trinucleotide circular codes / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 16:50, 6 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Dinucleotide circular codes |
scientific article |
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