Rearrangement distance problems: an updated survey

AR Oliveira, KL Brito, AO Alexandrino… - ACM Computing …, 2024 - dl.acm.org
One of the challenges in the Comparative Genomics field is to infer how close two
organisms are based on the similarities and differences between their genetic materials …

[图书][B] Combinatorics of genome rearrangements

G Fertin - 2009 - books.google.com
A comprehensive survey of a rapidly expanding field of combinatorial optimization,
mathematically oriented but offering biological explanations when required. From one cell to …

Quantum routing with fast reversals

A Bapat, AM Childs, AV Gorshkov, S King… - Quantum, 2021 - quantum-journal.org
We present methods for implementing arbitrary permutations of qubits under interaction
constraints. Our protocols make use of previous methods for rapidly reversing the order of …

Sorting signed permutations by short operations

GR Galvão, O Lee, Z Dias - Algorithms for Molecular Biology, 2015 - Springer
Background During evolution, global mutations may alter the order and the orientation of the
genes in a genome. Such mutations are referred to as rearrangement events, or simply …

Models and algorithms for genome rearrangement with positional constraints

KM Swenson, P Simonaitis, M Blanchette - Algorithms for molecular …, 2016 - Springer
Background Traditionally, the merit of a rearrangement scenario between two gene orders
has been measured based on a parsimony criteria alone; two scenarios with the same …

An exact algorithm for sorting by weighted preserving genome rearrangements

T Hartmann, M Bernt… - IEEE/ACM transactions on …, 2018 - ieeexplore.ieee.org
The preserving Genome Sorting Problem (pGSP) asks for a shortest sequence of
rearrangement operations that transforms a given gene order into another given gene order …

Finding local genome rearrangements

P Simonaitis, KM Swenson - Algorithms for Molecular Biology, 2018 - Springer
Background The double cut and join (DCJ) model of genome rearrangement is well studied
due to its mathematical simplicity and power to account for the many events that transform …

The Hierarchy of Hereditary Sorting Operators

V Jelínek, M Opler, J Pekárek - Proceedings of the 2024 Annual ACM-SIAM …, 2024 - SIAM
We consider the following general model of a sorting procedure: we fix a hereditary
permutation class C, which corresponds to the operations that the procedure is allowed to …

Length-weighted -rearrangement distance

AO Alexandrino, GHS Miranda, CN Lintzmayer… - Journal of Combinatorial …, 2021 - Springer
Comparative genomics is a field of biology that aims at comparing genomes of different
species. One major question of this field is to find the evolutionary distance between two …

Length and symmetry on the sorting by weighted inversions problem

C Baudet, U Dias, Z Dias - … Symposium on Bioinformatics, BSB 2014, Belo …, 2014 - Springer
Large-scale mutational events that occur when stretches of DNA sequence move throughout
genomes are called genome rearrangement events. In bacteria, inversions are one of the …