3 papers
cs.DS2025
Approximations for the Weighted Reversal, Transposition, and Indel Distance Problem with Intergenic Region Information
Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Zanoni Dias
Genome rearrangement distances are an established method in genome comparison. Works in this area may include various rearrangement operations representing large-scale mutations, g…
q-bio.QM2025
Heuristics based on Adjacency Graph Packing for DCJ Distance Considering Intergenic Regions
Gabriel Siqueira, Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira +1
In this work, we explore heuristics for the Adjacency Graph Packing problem, which can be applied to the Double Cut and Join (DCJ) Distance Problem. The DCJ is a rearrangement oper…
cs.DS2024
Variações do Problema de Distância de Rearranjos
Alexsandro Oliveira Alexandrino
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. Seminal work…