Trinucleotide k-circular codes I: theory - Ecole Nationale du Génie de l'Eau et de l'Environnement de Strasbourg Accéder directement au contenu
Article Dans Une Revue BioSystems Année : 2022

Trinucleotide k-circular codes I: theory

Résumé

A code X is (≥ k)-circular if any concatenation of at most k words from X, when read on a circle, admits exactly one partition into words from X. A code that is (≥ k)-circular for all integers k is said to be circular. Any code is (≥ 0)-circular and it turns out that a code of trinucleotides is circular as soon as it is (≥ 4)-circular. A code is k-circular if it is (≥ k)-circular and not (≥ k+1)-circular. Due to the explosive combinatorics of trinucleotide k-circular codes, we developed three classes of algorithms based on: (i) the smallest directed cycles (directed girth) in graphs; (ii) the eigenvalues of matrices; and (iii) the files that incrementally save partial results. These different approaches also allow us to verify the computational results obtained. We determine here the growth functions of trinucleotide k-circular codes, k varying between 0 and 4, in the general case and in various particular cases: minimum, minimal, maximum, self-complementary, (k, k, k)-circular and self-complementary (k, k, k)-circular.
Fichier principal
Vignette du fichier
MMS21.pdf (484.77 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03335164 , version 1 (06-09-2021)

Identifiants

Citer

Christian J Michel, Baptiste Mouillon, Jean-Sébastien Sereni. Trinucleotide k-circular codes I: theory. BioSystems, 2022, 217, pp.104667. ⟨10.1016/j.biosystems.2022.104667⟩. ⟨hal-03335164⟩
34 Consultations
127 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More