5 citations · 7 across the 3 of their papers we have counts for
3 papers
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…
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…