Approximation algorithms for sorting permutations by length-weighted short rearrangements AO Alexandrino, GHS Miranda, CN Lintzmayer, Z Dias Electronic Notes in Theoretical Computer Science 346, 29-40, 2019 | 5 | 2019 |
Sorting permutations by limited-size operations GHS Miranda, CN Lintzmayer, Z Dias International Conference on Algorithms for Computational Biology, 76-87, 2018 | 5 | 2018 |
Length-weighted -rearrangement distance AO Alexandrino, GHS Miranda, CN Lintzmayer, Z Dias Journal of Combinatorial Optimization 41 (3), 579-602, 2021 | 4 | 2021 |
Approximation Algorithms for Sorting λ-Permutations by λ-Operations GHS Miranda, AO Alexandrino, CN Lintzmayer, Z Dias Algorithms 14 (6), 175, 2021 | 3 | 2021 |
Sorting-Permutations by-Operations GHS Miranda, AO Alexandrino, C Negri Lintzmayer, Z Dias Brazilian Symposium on Bioinformatics, 1-13, 2018 | 3* | 2018 |
Ordenação de Permutações por Operações de Tamanho Limitado GHS Miranda [sn], 2019 | | 2019 |