Português
Sections

Publications

If you use Rearrangement Distance Database or GRAAu in your research, please cite the appropriate paper listed below.


Our papers using Rearrangement Distance Database or GRAAu

  • Galvão, G. R., Lee, O., and Dias, Z. Sorting signed permutations by short operations. Algorithms for Molecular Biology, 10:12, 2015.
  • Galvão, G. R. and Dias, Z. On Alternative Approaches for Approximating the Transposition Distance. Journal of Universal Computer Science, vol. 20, no. 9, pages 1259-1283, 2014.
  • Galvão, G. R. and Dias, Z. Approximation Algorithms for Sorting by Signed Short Reversals. In Proceedings of the 5th ACM Conference on Bioinformatics, Computational Biology, and Health Informatics (ACM-BCB'2014), pages 360-369, Newport Beach, CA, USA, 2014.
  • Dias, U., Galvão, G. R., Lintzmayer, C. N. and Dias, Z. A general heuristic for genome rearrangement problems. Journal of Bioinformatics and Computational Biology, 12, 1450012, 2014.
  • Lintzmayer, C. N. and Dias, Z. On the Diameter of Rearrangement Problems. In Proceedings of the First International Conference on Algorithms for Computational Biology (AICoB'2014), LNCS, v. 8542, pages 158-170, Tarragona, Spain, 2014.
  • Galvão, G. R. and Dias, Z. On the Approximation Ratio of Algorithms for Sorting by Transpositions without Using Cycle Graphs. In Proceedings of the 7th Brazilian Symposium on Bioinformatics (BSB'2012), LNCS, v. 7049, pages 25-36, Campo Grande, MS, Brazil, 2012.
  • Galvão, G. R. and Dias, Z. On the Performance of Sorting Permutations by Prefix Operations. In Proceedings of the 4th International Conference on Bioinformatics and Computational Biology (BICoB'2012), pages 102-107, Las Vegas, Nevada, USA, 2012.

Other papers using Rearrangement Distance Database or GRAAu

  • Benavidez, T. R. Polynomial Formulae for the k-Slice of the Symmetric Group under Various Genome Rearrangement Models. Honors Math Thesis, University of Oklahoma, 2014.
  • Silva, L. A. G. Um algoritmo algebrico para o Problema da Distancia de Transposicao em Rearranjo de Genomas. Master's thesis, University of Brasilia, 2013.
  • Labarre, A. Lower bounding edit distances between permutations. SIAM Journal on Discrete Mathematics, 27(3), pages 1410–1428, 2013.
  • Grusea, A. and Labarre, A. The distribution of cycles in breakpoint graphs of signed permutations. Discrete Applied Mathematics, 161, pages 1448–1466, 2013.