Genome rearrangements are mutations affecting large portions of a genome, and a reversal
is one of the most studied genome rearrangements in the literature through the Sorting by …

The rearrangement distance is a method to compare genomes of different species. Such
distance is the number of rearrangement events necessary to transform one genome into …

Recent works on genome rearrangements have shown that incorporating intergenic region
information along with gene order in models provides better estimations for the …

The most common way to calculate the rearrangement distance between two genomes is to
use the size of a minimum length sequence of rearrangements that transforms one of the two …

Biologists have proposed a vast list of problems heavily studied by mathematicians,
computer scientists, and statisticians. From a theoretical point of view, biology can inspire …

Background sorting by transpositions (SBT) is a classical problem in genome
rearrangements. In 2012, SBT was proven to be NP-hard and the best approximation …

Genome rearrangements are mutations that change the gene content of a genome or the
arrangement of the genes on a genome. Several years of research on genome …

Most mathematical models for genome rearrangement problems have considered only gene
order. In this way, the rearrangement distance considering some set of events, such as …

Considering a pair of genomes, the goal of rearrangement distance problems is to estimate
how distant these genomes are from each other based on genome rearrangements …

O Problema da Ordenação por Transposições (SBT, sigla dos termos em língua inglesa
Sorting By Transpositions) é um problema clássico em rearranjos de genoma. Em 2012 …