Author:
Alexandrino Alexsandro Oliveira,Miranda Guilherme Henrique Santos,Negri Lintzmayer Carla,Dias Zanoni
Funder
CNPq
São Paulo Research Foundation
Brazilian Federal Agency for the Support and Evaluation of Graduate Education
Subject
General Computer Science,Theoretical Computer Science
Reference16 articles.
1. 1.375-Approximation Algorithm for Sorting by Reversals;Berman,2002
2. Sorting by Transpositions is Difficult;Bulteau;SIAM Journal on Computing,2012
3. Sorting Permutations by Reversals and Eulerian Cycle Decompositions;Caprara;SIAM Journal on Discrete Mathematics,1999
4. A 1.375-Approximation Algorithm for Sorting by Transpositions;Elias;IEEE/ACM Transactions on Computational Biology and Bioinformatics,2006
5. Sorting Signed Permutations by Short Operations;Galvão;Algorithms for Molecular Biology,2015
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Length-weighted $$\lambda $$-rearrangement distance;Journal of Combinatorial Optimization;2020-11-18
2. A parallel algorithm for iterating partitions of a finite set into subsets of a given cardinality;Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes;2020