A path-deformation framework for determining weighted genome
rearrangement distance
rearrangement distance
File(s)2008.05560v1.pdf (209.72 KB)
Working paper
Author(s)
Type
Working Paper
Abstract
Measuring the distance between two bacterial genomes under the inversion
process is usually done by assuming all inversions to occur with equal
probability. Recently, an approach to calculating inversion distance using
group theory was introduced, and is effective for the model in which only very
short inversions occur. In this paper, we show how to use the group-theoretic
framework to establish minimal distance for any weighting on the set of
inversions, generalizing previous approaches. To do this we use the theory of
rewriting systems for groups, and exploit the Knuth--Bendix algorithm, the
first time this theory has been introduced into genome rearrangement problems.
The central idea of the approach is to use existing group theoretic methods
to find an initial path between two genomes in genome space (for instance using
only short inversions), and then to deform this path to optimality using a
confluent system of rewriting rules generated by the Knuth--Bendix algorithm.
process is usually done by assuming all inversions to occur with equal
probability. Recently, an approach to calculating inversion distance using
group theory was introduced, and is effective for the model in which only very
short inversions occur. In this paper, we show how to use the group-theoretic
framework to establish minimal distance for any weighting on the set of
inversions, generalizing previous approaches. To do this we use the theory of
rewriting systems for groups, and exploit the Knuth--Bendix algorithm, the
first time this theory has been introduced into genome rearrangement problems.
The central idea of the approach is to use existing group theoretic methods
to find an initial path between two genomes in genome space (for instance using
only short inversions), and then to deform this path to optimality using a
confluent system of rewriting rules generated by the Knuth--Bendix algorithm.
Date Issued
2020-08-12
Citation
2020
Publisher
arXiv
Copyright Statement
© 2020 The Author(s)
Identifier
http://arxiv.org/abs/2008.05560v1
Subjects
math.CO
math.CO
q-bio.PE
Notes
15 pages, 4 figures. To appear in Frontiers in Genetics: Evolution and Population Genetics, in a special issue on Algebraic and Geometric Phylogenetics
Publication Status
Published