2018
DOI: 10.1007/s11538-018-0514-3
|View full text |Cite
|
Sign up to set email alerts
|

Position and Content Paradigms in Genome Rearrangements: The Wild and Crazy World of Permutations in Genomics

Abstract: Modellers of large scale genome rearrangement events, in which segments of DNA are inverted, moved, swapped, or even inserted or deleted, have found a natural syntax in the language of permutations. Despite this, there has been a wide range of modelling choices, assumptions and interpretations that make navigating the literature a significant challenge. Indeed, even authors of papers that use permutations to model genome rearrangement can struggle to interpret each others' work, because of subtle differences i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2019
2019
2023
2023

Publication Types

Select...
7
1

Relationship

1
7

Authors

Journals

citations
Cited by 17 publications
(24 citation statements)
references
References 34 publications
0
24
0
Order By: Relevance
“…Dividing each of these by 4! and summing over the dihedral group as in (2), we find explicit expressions (constant time in k) for the number of passages G 0 → G ≡ σ using rearrangement moves belonging to M = {(1, 2), (2,3), (3,4), (4, 1)}. In particular we see that we have the limits (as a proportion of total number of passage counts):…”
Section: Computation Of Path Counts Using Group Charactersmentioning
confidence: 83%
See 1 more Smart Citation
“…Dividing each of these by 4! and summing over the dihedral group as in (2), we find explicit expressions (constant time in k) for the number of passages G 0 → G ≡ σ using rearrangement moves belonging to M = {(1, 2), (2,3), (3,4), (4, 1)}. In particular we see that we have the limits (as a proportion of total number of passage counts):…”
Section: Computation Of Path Counts Using Group Charactersmentioning
confidence: 83%
“…Given a genome as an (unorientated) cyclic order of N genes, the effect of a rearrangement is described as the application of a permutation α ∈ S N understood as moving the gene in location i to location α(i) (this is the "positions" paradigm as described in [3]). Taking the canonical cyclic ordering as reference, each genome is determined by a permutation σ ∈ S N where j = σ(i) is understood as indicating that gene i is in location j = σ(i).…”
Section: Rearrangement Models For Bacterial Genomesmentioning
confidence: 99%
“…Modelling genomes with oriented regions as elements of the hyperoctahedral group is standard; we refer to Bhatia et al [5] and Egri-Nagy et al [12] for detailed treatments. We consider that the genomes of interest share n regions in common, where each region is a contiguous section of DNA (these may also be referred to as synteny blocks or conserved regions).…”
Section: Genome Instances and Permutation Cloudsmentioning
confidence: 99%
“…As classified by Bhatia et al [5] in their excellent overview, algebraic frameworks for modelling genome rearrangement tend to use either the "content" or the "position" paradigm. In the former paradigm, genomes are represented in terms of the adjacencies between regions; in the latter, positions as well as regions are labelled, and genomes are denoted by maps that link regions to positions.…”
Section: Introductionmentioning
confidence: 99%
“…When the genome is modeled as a map from positions to regions and a rearrangement operator is a bijection on the set of positions, we require that the rearrangement operator act first on a position and then we map the new position to a region using the genome map, and so the function composition is from left to right. For a detailed discussion of right and left actions (see Bhatia et al, 2018). The inversion operator t i,j maps π as follows:…”
Section: Genomes As Permutations and Inversion As An Actionmentioning
confidence: 99%