Evidence map›Paper›PMID 29260295›Full record

ArticleJournal of mathematical biology2018

Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem.

Sonja J Prohaska, Sarah J Berkemer, Fabian Gärtner, Thomas Gatter, Nancy Retzlaff, Students of the Graphs and Biological Networks Lab 2017, Christian Höner Zu Siederdissen, Peter F Stadler

Open access · hybridAbstract read
In one paragraph

Article in Journal of mathematical biology, 2018. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact, top 85% 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

1 citing paper in PubMed, 2 citations in OpenAlex.

  1. 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

8 authors at 3 institutions in 4 countries.

Sonja J ProhaskaComputational EvoDevo Group, Department of Computer Science and Interdisciplinary Center for Bioinformatics, Universität Leipzig, Härtelstraße 16-18, 04107, Leipzig, Germany.
Sarah J BerkemerMax Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103, Leipzig, Germany.
Fabian GärtnerCompetence Center for Scalable Data Services and Solutions Dresden/Leipzig and Bioinformatics Group, Department of Computer Science, Universität Leipzig, Härtelstraße 16-18, 04107, Leipzig, Germany.
Thomas GatterBioinformatics Group, Department of Computer Science and Interdisciplinary Center for Bioinformatics, Universität Leipzig, Härtelstraße 16-18, 04107, Leipzig, Germany.
Nancy RetzlaffMax Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103, Leipzig, Germany.
Students of the Graphs and Biological Networks Lab 2017
Christian Höner Zu SiederdissenBioinformatics Group, Department of Computer Science and Interdisciplinary Center for Bioinformatics, Universität Leipzig, Härtelstraße 16-18, 04107, Leipzig, Germany.
Peter F StadlerMax Planck Institute for Mathematics in the Sciences, Inselstraße 22, 04103, Leipzig, Germany. studla@bioinf.uni-leipzig.de.ORCID 0000-0002-5016-5191
Max Planck Institute for Mathematics in the Sciences · DELeipzig University · DEUniversity of Vienna · AT

Funding

Bundesministerium für Bildung und Forschung BMBF 01IS14014B (SCaDS)Deutsche Forschungsgemeinschaft STA 850/19-2 (SPP 1738)
6 · The paper itself

Abstract

Clusters of paralogous genes such as the famous HOX cluster of developmental transcription factors tend to evolve by stepwise duplication of its members, often involving unequal crossing over. Gene conversion and possibly other mechanisms of concerted evolution further obfuscate the phylogenetic relationships. As a consequence, it is very difficult or even impossible to disentangle the detailed history of gene duplications in gene clusters. In this contribution we show that the expansion of gene clusters by unequal crossing over as proposed by Walter Gehring leads to distinctive patterns of genetic distances, namely a subclass of circular split systems. Furthermore, when the gene cluster was left undisturbed by genome rearrangements, the shortest Hamiltonian paths with respect to genetic distances coincide with the genomic order. This observation can be used to detect ancient genomic rearrangements of gene clusters and to distinguish gene clusters whose evolution was dominated by unequal crossing over within genes from those that expanded through other mechanisms.

Indexed as

Models, GeneticMultigene FamilyAlcohol DehydrogenaseAlgorithmsAnimalsComputer SimulationCrossing Over, GeneticEvolution, MolecularGene DuplicationGenes, HomeoboxGenomeHumansMathematical ConceptsPhylogenyRecombination, GeneticAlcohol DehydrogenaseEvolution of gene clustersHamiltonian path problemsKalmanson metricsNon-homologous recombinationPhylogenetic combinatoricsUnequal crossing over

Identifiers

PMID29260295
PMCPMC6060901
OpenAlexW2776775512

What OpenQuestion holds

Textmetadata
LicenceCC BY
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.