On Variants of the Genome Rearrangement Distance Problem
In comparative genomics, evolutionary distance can be estimated by determining a minimum sequence of genome rearrangements required to transform one genome into another. The length of this sequence is called the rearrangement distance. Traditionally, most studies assumed that compared genomes shared the same set of genes, with only their relative gene order being used for comparison. Recent studies indicate that incorporating intergenic region sizes leads to more accurate distance estimates when analyzing real genomes. Furthermore, they started to consider genomes having a distinct set of genes. In this work, we investigate genome rearrangement problems by incorporating additional information and complexity into the models, in order to achieve more realistic practical results that can benefit several scientific fields.
Authors
- Alexsandro Oliveira Alexandrino (ORCID: https://orcid.org/0000-0002-6320-9747)
- Zanoni Dias (ORCID: https://orcid.org/0000-0003-3333-6822)
- Ulisses Dias (ORCID: https://orcid.org/0000-0002-4763-3046)
Institutions
- Hospital de Clínicas da Unicamp (BR)
Publication Details
- Published
- 2025-07-20
- DOI
- https://doi.org/10.5753/ctd.2025.7128
- Primary Topic
- Genome Rearrangement Algorithms
- Type
- article
- Field-Weighted Citation Impact
- 0.00