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 …

Group-theoretic models of the inversion process in bacterial genomes

A Egri-Nagy, V Gebhardt, MM Tanaka… - Journal of Mathematical …, 2014 - Springer
The variation in genome arrangements among bacterial taxa is largely due to the process of
inversion. Recent studies indicate that not all inversions are equally probable, suggesting …

Improved bounds on sorting by length-weighted reversals

MA Bender, D Ge, S He, H Hu, RY Pinter… - Journal of Computer and …, 2008 - Elsevier
We study the problem of sorting binary sequences and permutations by length-weighted
reversals. We consider a wide class of cost functions, namely f (ℓ)= ℓα for all α⩾ 0, where ℓ is …

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 …

An algebraic view of bacterial genome evolution

AR Francis - Journal of mathematical biology, 2014 - Springer
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 …

[PDF][PDF] Improved bounds on sorting with length-weighted reversals.

MA Bender, D Ge, S He, H Hu, RY Pinter, S Skiena… - SODA, 2004 - cs.stonybrook.edu
We study the problem of sorting binary sequences and permutations by length-weighted
reversals. We consider a wide class of cost functions, namely f (i)= iα for all α≥ 0, where i is …

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 …

Sorting by restricted-length-weighted reversals

TC Nguyen, HT Ngo, NB Nguyen - Genomics, Proteomics and …, 2005 - academic.oup.com
Classical sorting by reversals uses the unit-cost model, that is, each reversal consumes an
equal cost. This model limits the biological meaning of sorting by reversal. Bender and his …

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 …