( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Sorting Separable Permutations by Restricted Multi-break Rearrangements.

, , и . CTW, стр. 145-148. (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Luis Antonio Carrillo Corado

Daniela Brasil

Luis Antônio Silva Jäger

Luis Antonio Barrales-Mora

Werner Luis

 

Другие публикации лиц с тем же именем

Advancing the Transposition Distance and Diameter through Lonely Permutations., , , и . SIAM J. Discret. Math., 27 (4): 1682-1709 (2013)On the Toric Graph as a Tool to Handle the Problem of Sorting by Transpositions., , , и . BSB, том 5167 из Lecture Notes in Computer Science, стр. 79-91. Springer, (2008)The graph tessellation cover number: extremal bounds, efficient algorithms and hardness., , , , , , , и . CoRR, (2017)On the 1.375-Approximation Algorithm for Sorting by Transpositions in O(n logn) Time., , , и . BSB, том 8213 из Lecture Notes in Computer Science, стр. 126-135. Springer, (2013)A new 1.375-approximation algorithm for sorting by transpositions., , , и . Algorithms Mol. Biol., 17 (1): 1 (2022)A Quantum Version of Pollard's Rho of Which Shor's Algorithm is a Particular Case., и . COCOON, том 13595 из Lecture Notes in Computer Science, стр. 212-219. Springer, (2022)A reversible circuit synthesis algorithm with progressive increase of controls in generalized Toffoli gates., , , , и . J. Univers. Comput. Sci., 27 (6): 544-563 (2021)Hamiltonian cycles in unitary prefix transposition rearrangement graphs., , , , и . Discret. Appl. Math., (2015)Most direct product of graphs are Type 1., , , , и . CoRR, (2021)A Barrier for Further Approximating Sorting by Transpositions., , и . J. Comput. Biol., 30 (12): 1277-1288 (декабря 2023)