5 citations · 7 across the 5 of their papers we have counts for
5 papers
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…
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…
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…
Algorithms for the Maximum Eulerian Cycle Decomposition Problem
Pedro O. Pinheiro, Alexsandro Oliveira Alexandrino, Andre R. Oliveira +2
Given an Eulerian graph G, in the Maximum Eulerian Cycle Decomposition problem, we are interested in finding a collection of edge-disjoint cycles {E_1, E_2, ..., E_k} in G such tha…
On the Complexity of Some Variations of Sorting by Transpositions
Alexsandro Oliveira Alexandrino, Andre Rodrigues Oliveira, Ulisses Dias +1
One of the main challenges in Computational Biology is to find the evolutionary distance between two organisms. In the field of comparative genomics, one way to estimate such dista…