SearcharxivSearch

arXiv · 1311.6151

An algebraic view of bacterial genome evolution

Abstract

Rearrangements of bacterial chromosomes can be studied mathematically at several levels, most prominently at a local, or sequence level, as well as at a topological level. The biological changes involved locally are inversions, deletions, and transpositions, while topologically they are knotting and catenation. These two modelling approaches share some surprising algebraic features related to braid groups and Coxeter groups. The structural approach that is at the core of algebra has long found applications in sciences such as physics and analytical chemistry, but only in a small number of ways so far in biology. And yet there are examples where an algebraic viewpoint may capture a deeper structure behind biological phenomena. This article discusses a family of biological problems in bacterial genome evolution for which this may be the case, and raises the prospect that the tools developed by algebraists over the last century might provide insight to this area of evolutionary biology. .

Explore related subjects

Keep this discovery

BibTeXRIS

Andrew R. Francis. 2013-12-09. An algebraic view of bacterial genome evolution. https://arxiv.org/abs/1311.6151

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR