Alexsandro Oliveira Alexandrino

Géraldine Jean

Guillaume Fertin

J. Heuristics, December, 2024

Rearrangement Distance Problems: An updated survey.

[BibT_eX]

[DOI]

ACM Comput. Surv., August, 2024

Variações do Problema de Distância de Rearranjos.

[BibT_eX]

[DOI]

CoRR, 2024

Maximum Alternating Balanced Cycle Decomposition and Applications in Sorting by Intergenic Operations Problems.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 21st International Conference, 2024

2023

Signed rearrangement distances considering repeated genes, intergenic regions, and indels.

[BibT_eX]

[DOI]

J. Comb. Optim., September, 2023

Reversal and Transposition Distance on Unbalanced Genomes Using Intergenic Information.

[BibT_eX]

[DOI]

J. Comput. Biol., August, 2023

Rearrangement distance with reversals, indels, and moves in intergenic regions on signed and unsigned permutations.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., April, 2023

Genome Rearrangement Distance With a Flexible Intergenic Regions Aspect.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Reversal and Indel Distance With Intergenic Region Information.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2023

Approximation algorithms for sorting by k-cuts on signed permutations.

[BibT_eX]

[DOI]

J. Comb. Optim., 2023

Block Interchange and Reversal Distance on Unbalanced Genomes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2023

Approximating Rearrangement Distances with Replicas and Flexible Intergenic Regions.

[BibT_eX]

[DOI]

Géraldine Jean

Guillaume Fertin

Proceedings of the Bioinformatics Research and Applications - 19th International Symposium, 2023

2022

Labeled Cycle Graph for Transposition and Indel Distance.

[BibT_eX]

[DOI]

J. Comput. Biol., 2022

Algorithms for the Maximum Eulerian Cycle Decomposition Problem.

[BibT_eX]

[DOI]

Pedro Olímpio Pinheiro

Cid C. de Souza

CoRR, 2022

A 1.375-Approximation Algorithm for Sorting by Transpositions with Faster Running Time.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2022

Sorting by k-Cuts on Signed Permutations.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 19th International Conference, 2022

A New Approach for the Reversal Distance with Indels and Moves in Intergenic Regions.

[BibT_eX]

[DOI]

Proceedings of the Comparative Genomics - 19th International Conference, 2022

Transposition Distance Considering Intergenic Regions for Unbalanced Genomes.

[BibT_eX]

[DOI]

Proceedings of the Bioinformatics Research and Applications - 18th International Symposium, 2022

2021

Length-weighted λ-rearrangement distance.

[BibT_eX]

[DOI]

J. Comb. Optim., 2021

Genome Rearrangement Distance with Reversals, Transpositions, and Indels.

[BibT_eX]

[DOI]

J. Comput. Biol., 2021

Reversals and transpositions distance with proportion restriction.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2021

Incorporating intergenic regions into reversal and transposition distances with indels.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2021

Approximation algorithm for rearrangement distances considering repeated genes and intergenic regions.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2021

An improved approximation algorithm for the reversal and transposition distance considering gene order and intergenic sizes.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2021

Approximation Algorithms for Sorting λ-Permutations by λ-Operations.

[BibT_eX]

[DOI]

Algorithms, 2021

Heuristics for Cycle Packing of Adjacency Graphs for Genomes with Repeated Genes.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2021

Reversal and Transposition Distance of Genomes Considering Flexible Intergenic Regions.

[BibT_eX]

[DOI]

Proceedings of the XI Latin and American Algorithms, Graphs and Optimization Symposium, 2021

Reversals Distance Considering Flexible Intergenic Regions Sizes.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Computational Biology - 8th International Conference, 2021

Reversal Distance on Genomes with Different Gene Content and Intergenic Regions Information.

[BibT_eX]

[DOI]

Proceedings of the Algorithms for Computational Biology - 8th International Conference, 2021

2020

On the Complexity of Some Variations of Sorting by Transpositions.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2020

Sorting permutations by fragmentation-weighted operations.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2020

Heuristics for Breakpoint Graph Decomposition with Applications in Genome Rearrangement Problems.

[BibT_eX]

[DOI]

Pedro Olímpio Pinheiro

Cid Carvalho de Souza

Proceedings of the Advances in Bioinformatics and Computational Biology, 2020

Sorting by Reversals and Transpositions with Proportion Restriction.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2020

2019

Approximation Algorithms for Sorting Permutations by Length-Weighted Short Rearrangements.

[BibT_eX]

[DOI]

Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018

Sorting λ-Permutations by λ-Operations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2018

Approximation Algorithms for Sorting Permutations by Fragmentation-Weighted Operations.

[BibT_eX]

[DOI]