8 citations · 19 across the 11 of their papers we have counts for
12 papers
Twisted Bracelets for Sorting by Transpositions: the Transposition Diameter of
Luiz A. G. Silva, Luis A. B. Kowada, Noraí R. Rocco +1
Sorting By Transpositions (SBT) seeks the minimum number of transpositions required to sort a permutation on symbols into the identity . Let . A cyclic-target pai…
Quantum kernel and HHL-based support vector machines for multi-class classification
Gabriela Pinheiro, Donovan Slabbert, Luis Kowada +1
We compare two quantum approaches that use support vector machines for multi-class classification on a reduced Sloan Digital Sky Survey (SDSS) dataset: the quantum kernel-based QSV…
A barrier for further approximating Sorting By Transpositions
Luiz Augusto G. da Silva, Luis Antonio B. Kowada, Maria Emília M. T. Walter
The Transposition Distance Problem (TDP) is a classical problem in genome rearrangements which seeks to determine the minimum number of transpositions needed to transform a linear…
Most direct product of graphs are Type 1
Diane Castonguay, Celina M. H. de Figueiredo, Luis Antonio Kowada +2
A \textit{-total coloring} of a graph is an assignment of colors to its elements (vertices and edges) so that adjacent or incident elements have different colors. The to…
A quantum version of Pollard's Rho of which Shor's Algorithm is a particular case
Daniel Chicayban Bastos, Luis Antonio Kowada
Pollard's Rho is a method for solving the integer factorization problem. The strategy searches for a suitable pair of elements belonging to a sequence of natural numbers that given…
A new 1.375-approximation algorithm for Sorting By Transpositions
L. A. G. Silva, L. A. B. Kowada, N. R. Rocco +1
In genome rearrangements, the mutational event transposition swaps two adjacent blocks of genes in one chromosome. The Transposition Distance Problem (TDP) aims to find the minimum…