Luis Antonio Brasil Kowada

Mario Valencia-Pabon

RAIRO Oper. Res., 2024

2023

A Barrier for Further Approximating Sorting by Transpositions.

[BibT_eX]

[DOI]

Luiz Augusto G. Silva

Maria Emília M. T. Walter

J. Comput. Biol., December, 2023

On total coloring the direct product of cycles and bipartite direct product of graphs.

[BibT_eX]

[DOI]

Discret. Math., June, 2023

2022

A new 1.375-approximation algorithm for sorting by transpositions.

[BibT_eX]

[DOI]

Luiz Augusto G. Silva

Maria Emília M. T. Walter

Noraí Romeu Rocco

Algorithms Mol. Biol., 2022

A Quantum Version of Pollard's Rho of Which Shor's Algorithm is a Particular Case.

[BibT_eX]

[DOI]

Daniel Chicayban Bastos

Proceedings of the Computing and Combinatorics - 28th International Conference, 2022

2021

A computational complexity comparative study of graph tessellation problems.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

A reversible circuit synthesis algorithm with progressive increase of controls in generalized Toffoli gates.

[BibT_eX]

[DOI]

Edinelço Dalcumune

Celina Miraglia Herrera de Figueiredo

André da Cunha Ribeiro

Franklin de Lima Marquezino

J. Univers. Comput. Sci., 2021

Most direct product of graphs are Type 1.

[BibT_eX]

[DOI]

CoRR, 2021

On total coloring the direct product of complete graphs.

[BibT_eX]

[DOI]

Mario Valencia-Pabon

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

How to detect whether Shor's algorithm succeeds against large integers without a quantum computer.

[BibT_eX]

[DOI]

Daniel Chicayban Bastos

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

2020

The graph tessellation cover number: Chromatic bounds, efficient algorithms and hardness.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

On the computational complexity of closest genome problems.

[BibT_eX]

[DOI]

Vinícius Fernandes dos Santos

Pedro Feijão

Discret. Appl. Math., 2020

An algebraic 1.375-approximation algorithm for the Transposition Distance Problem.

[BibT_eX]

[DOI]

Luiz Augusto G. Silva

Maria Emília M. T. Walter

Noraí Romeu Rocco

CoRR, 2020

2019

The Tessellation Cover Number of Good Tessellable Graphs.

[BibT_eX]

[DOI]

CoRR, 2019

Measuring randomness in IoT products.

[BibT_eX]

[DOI]

Daniel Chicayban Bastos

Raphael C. S. Machado

Proceedings of the 2nd Workshop on Metrology for Industry 4.0 and IoT MetroInd4.0&IoT 2019, 2019

2018

Identifying Maximal Perfect Haplotype Blocks.

[BibT_eX]

[DOI]

Yoan Diekmann

Proceedings of the Advances in Bioinformatics and Computational Biology, 2018

The Graph Tessellation Cover Number: Extremal Bounds, Efficient Algorithms and Hardness.

[BibT_eX]

[DOI]

Tharso D. Fernandes

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

2017

New Genome Similarity Measures based on Conserved Gene Adjacencies.

[BibT_eX]

[DOI]

Daniel Doerr

J. Comput. Biol., 2017

Fast and Simple Jumbled Indexing for Binary RLE Strings.

[BibT_eX]

[DOI]

CoRR, 2017

The tessellation problem of quantum walks.

[BibT_eX]

[DOI]

Tharso D. Fernandes

CoRR, 2017

Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016

QEDS: Um Simulador Clássico para Distinção de Elementos Quântico.

[BibT_eX]

[DOI]

Matheus Manzoli Ferreira

Franklin de Lima Marquezino

RITA, 2016

New Genome Similarity Measures Based on Conserved Gene Adjacencies.

[BibT_eX]

[DOI]

Daniel Doerr

Simone Dantas

Proceedings of the Research in Computational Molecular Biology - 20th Annual Conference, 2016

2015

A Faster 1.375-Approximation Algorithm for Sorting by Transpositions*.

[BibT_eX]

[DOI]

J. Comput. Biol., 2015

A new reversible circuit synthesis algorithm based on cycle representations of permutations.

[BibT_eX]

[DOI]

A. C. Ribeiro

Electron. Notes Discret. Math., 2015

Hamiltonian cycles in unitary prefix transposition rearrangement graphs.

[BibT_eX]

[DOI]

C. S. Reis

Letícia Rodrigues Bueno

A. C. Ribeiro

Discret. Appl. Math., 2015

Sorting Separable Permutations by Restricted Multi-break Rearrangements.

[BibT_eX]

Proceedings of the 13th Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2015

2013

Advancing the Transposition Distance and Diameter through Lonely Permutations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2013

2012

Cayley graphs and analysis of quantum cost for reversible circuit synthesis

[BibT_eX]

[DOI]

A. C. Ribeiro

CoRR, 2012

Transposition Diameter and Lonely Permutations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2012

2011

Analysis and Implementation of Sorting by Transpositions Using Permutation Trees.

[BibT_eX]

[DOI]

Marcelo P. Lopes

Marília D. V. Braga

Proceedings of the Advances in Bioinformatics and Computational Biology, 2011

2010

Unitary Toric Classes, the Reality and Desire Diagram, and Sorting by Transpositions.

[BibT_eX]

[DOI]

Luérbio Faria

SIAM J. Discret. Math., 2010

Bounds on the Transposition Distance for Lonely Permutations.

[BibT_eX]

[DOI]

Proceedings of the Advances in Bioinformatics and Computational Biology, 2010

2008

On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions.

[BibT_eX]

[DOI]

Luérbio Faria

Proceedings of the Advances in Bioinformatics and Computational Biology, 2008

2006

Reversible Karatsuba's Algorithm.

[BibT_eX]

[DOI]