Gustavo Rodrigues Galvão

Orcid: 0000-0001-6069-1147

According to our database1, Gustavo Rodrigues Galvão authored at least 9 papers between 2011 and 2017.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2017
Sorting Circular Permutations by Super Short Reversals.
IEEE ACM Trans. Comput. Biol. Bioinform., 2017

2015
Sorting signed permutations by short operations.
Algorithms Mol. Biol., 2015

Sorting Signed Circular Permutations by Super Short Reversals.
Proceedings of the Bioinformatics Research and Applications - 11th International Symposium, 2015

2014
On Alternative Approaches for Approximating the Transposition Distance.
J. Univers. Comput. Sci., 2014

An Audit Tool for Genome Rearrangement Algorithms.
ACM J. Exp. Algorithmics, 2014

A general heuristic for genome rearrangement problems.
J. Bioinform. Comput. Biol., 2014

Approximation algorithms for sorting by signed short reversals.
Proceedings of the 5th ACM Conference on Bioinformatics, 2014

2012
On the Approximation Ratio of Algorithms for Sorting by Transpositions without Using Cycle Graphs.
Proceedings of the Advances in Bioinformatics and Computational Biology, 2012

2011
Computing rearrangement distance of every permutation in the symmetric group.
Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011


  Loading...