Evidence map›Paper›PMID 29532441›Full record

ArticleTheory in biosciences = Theorie in den Biowissenschaften2018

Self-complementary circular codes in coding theory.

Elena Fimmel, Christian J Michel, Martin Starman, Lutz Strüngmann

Abstract read
PubMed Publisher
In one paragraph

Article in Theory in biosciences = Theorie in den Biowissenschaften, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.

0numbers the graph read from it
0cells of the map it votes in
7citing papers in PubMed
1.4field-weighted citation impact, top 19% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

7 citing papers in PubMed, 21 citations in OpenAlex.

  1. Article
  2. Equivalence classes of circular codes induced by permutation groups.Theory in biosciences = Theorie in den Biowissenschaften · 2021
    Article
  3. Article
  4. Circular Tessera Codes in the Evolution of the Genetic Code.Bulletin of mathematical biology · 2020
    Article
  5. Article
  6. Article
  7. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors at 2 institutions in 2 countries.

Elena FimmelFaculty for Computer Sciences, Institute of Mathematical Biology, Mannheim University of Applied Sciences, 68163, Mannheim, Germany.
Christian J MichelTheoretical Bioinformatics, ICube, CNRS, University of Strasbourg, 300 Boulevard Sébastien Brant, 67400, Illkirch, France. c.michel@unistra.fr.
Martin StarmanFaculty for Computer Sciences, Institute of Mathematical Biology, Mannheim University of Applied Sciences, 68163, Mannheim, Germany.
Lutz StrüngmannFaculty for Computer Sciences, Institute of Mathematical Biology, Mannheim University of Applied Sciences, 68163, Mannheim, Germany.
Mannheim University of Applied Sciences · DECentre National de la Recherche Scientifique · FR

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Self-complementary circular codes are involved in pairing genetic processes. A maximal [Formula: see text] self-complementary circular code X of trinucleotides was identified in genes of bacteria, archaea, eukaryotes, plasmids and viruses (Michel in Life 7(20):1-16 2017, J Theor Biol 380:156-177, 2015; Arquès and Michel in J Theor Biol 182:45-58 1996). In this paper, self-complementary circular codes are investigated using the graph theory approach recently formulated in Fimmel et al. (Philos Trans R Soc A 374:20150058, 2016). A directed graph [Formula: see text] associated with any code X mirrors the properties of the code. In the present paper, we demonstrate a necessary condition for the self-complementarity of an arbitrary code X in terms of the graph theory. The same condition has been proven to be sufficient for codes which are circular and of large size [Formula: see text] trinucleotides, in particular for maximal circular codes ([Formula: see text] trinucleotides). For codes of small-size [Formula: see text] trinucleotides, some very rare counterexamples have been constructed. Furthermore, the length and the structure of the longest paths in the graphs associated with the self-complementary circular codes are investigated. It has been proven that the longest paths in such graphs determine the reading frame for the self-complementary circular codes. By applying this result, the reading frame in any arbitrary sequence of trinucleotides is retrieved after at most 15 nucleotides, i.e., 5 consecutive trinucleotides, from the circular code X identified in genes. Thus, an X motif of a length of at least 15 nucleotides in an arbitrary sequence of trinucleotides (not necessarily all of them belonging to X) uniquely defines the reading (correct) frame, an important criterion for analyzing the X motifs in genes in the future.

Indexed as

Models, GeneticDNAEukaryotic CellsGenes, ArchaealGenes, BacterialGenes, ViralGenetic CodeModels, TheoreticalNucleotidesOligonucleotidesOpen Reading FramesPlasmidsRibosomesRNASaccharomyces cerevisiaeDNANucleotidesOligonucleotidesRNAGenetic codeGraph propertiesReading frameSelf-complementary circular codesTranslation process

Identifiers

PMID29532441
OpenAlexW2793176029

What OpenQuestion holds

Textmetadata
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.