Computing rearrangement distance of every permutation in the symmetric group. - Gustavo Rodrigues Galvão; Zanoni Dias (SAC, 2011)

On the Approximation Ratio of Algorithms for Sorting by Transpositions without Using Cycle Graphs. - Gustavo Rodrigues Galvão; Zanoni Dias (BSB, 2012)

Approximation algorithms for sorting by signed short reversals. - Gustavo Rodrigues Galvão; Zanoni Dias (BCB, 2014)

A general heuristic for genome rearrangement problems. - Ulisses Dias; Gustavo Rodrigues Galvão; Carla Negri Lintzmayer; Zanoni Dias (J. Bioinform. Comput. Biol., 2014)

An Audit Tool for Genome Rearrangement Algorithms. - Gustavo Rodrigues Galvão; Zanoni Dias (ACM J. Exp. Algorithmics, 2014)

On Alternative Approaches for Approximating the Transposition Distance. - Gustavo Rodrigues Galvão; Zanoni Dias (J. Univers. Comput. Sci., 2014)

Sorting Signed Circular Permutations by Super Short Reversals. - Gustavo Rodrigues Galvão; Christian Baudet; Zanoni Dias (ISBRA, 2015)

Sorting signed permutations by short operations. - Gustavo Rodrigues Galvão; Orlando Lee; Zanoni Dias (Algorithms Mol. Biol., 2015)

Algorithms for sorting by reversals or transpositions, with application to genome rearrangement : Algoritmos para problemas de ordenação por reversões ou transposições, com aplicações em rearranjo de genomas - Gustavo Rodrigues Galvão (2015)

Sorting Circular Permutations by Super Short Reversals. - Gustavo Rodrigues Galvão; Christian Baudet; Zanoni Dias (IEEE ACM Trans. Comput. Biol. Bioinform., 2017)