Varieties of comma-free codes

Authors:
Christian J. Michel;Giuseppe Pirillo;Mario A. Pirillo
Affiliations:
Equipe de Bioinformatique Théorique, LSIIT (UMR CNRS - ULP 7005), Université Louis Pasteur de Strasbourg, Pôle API, Boulevard Sébastien Brant, 67400 Illkirch, France;Consiglio Nazionale delle Ricerche, Istituto di Analisi dei Sistemi ed Informatica "Antonio Ruberti", Unití di Firenze, Dipartimento di Matematica "U.Dini", viale Morgagni 67/A, 50134 Firenze ...;Istituto Statale SS. Annunziata, Piazzale del Poggio Imperiale, Firenze, Italy
Venue:
Computers & Mathematics with Applications
Year:
2008

Citing 1
Cited 3

Identification of circular codes in bacterial genomes and their use in a factorization method for retrieving the reading frames of genes

Computational Biology and Chemistry

A relation between trinucleotide comma-free codes and trinucleotide circular codes

Theoretical Computer Science
Brief communication: Identification of all trinucleotide circular codes

Computational Biology and Chemistry
A classification of 20-trinucleotide circular codes

Information and Computation

Quantified Score

Hi-index	0.09

Visualization

Abstract

New varieties of comma-free codes CFC of length 3 on the 4-letter alphabet are defined and analysed: self-complementary comma-free codes (CCFC), C^3 comma-free codes (C^3CFC), C^3 self-complementary comma-free codes (C^3CCFC), self-complementary maximal comma-free codes (CMCFC), C^3 maximal comma-free codes (C^3MCFC) and C^3 self-complementary maximal comma-free codes (C^3CMCFC). New properties with words of length 3, 4, 5 and 6 in comma-free codes are used for the determination of growth functions in the studied code varieties.