𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generating Functions of Circular Codes

✍ Scribed by Frédérique Bassino

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
154 KB
Volume
22
Category
Article
ISSN
0196-8858

No coin nor oath required. For personal study only.

✦ Synopsis

We describe in terms of different parameters the generating series of the star of a circular code. We extend the characterization of length distributions of circular codes established for a finite alphabet by Schutzenberger to an arbitrary ''weighted'' älphabet.

In this framework, we give a new characterization of these length distributions. This one directly concerns the coefficients of the generating series of the code instead of the number of primitive conjugacy classes. This result shows that we can decide whether a finite sequence is the length distribution of a circular code. We also establish a necessary and sufficient condition for a series to be the length distribution of a maximal circular code over a finite alphabet.

📜 SIMILAR VOLUMES

Analysis of a Circular Code Model
Analysis of a Circular Code Model
✍ JÉRÔME LACAN; CHRISTIAN J. MICHEL 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 277 KB

A circular code has been identi"ed in the protein (coding) genes of both eukaryotes and prokaryotes by using a statistical method called trinucleotide frequency (TF) method [Arque`s & Michel (1996). J. theor. Biol. 182, 45}58]. Recently, a probabilistic model based on the nucleotide frequencies with

A Circular Code in the Protein Coding Ge
A Circular Code in the Protein Coding Genes of Mitochondria
✍ Didier G Arquès; Christian J Michel 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 298 KB

A new maximal circular code X0(MIT) with two permutated maximal circular codes X1(MIT) and X2(MIT) is identified in the protein coding genes of mitochondria. The three subsets of 20 trinucleotides X0(MIT)={ACA, ACC, ATA, ATC, CTA, CTC, GAA, GAC, GAT, GCA, GCC, GCT, GGA, GGC, GGT, GTA, GTC, GTT, TTA,