Author:
Lintzmayer Carla Negri,Fertin Guillaume,Dias Zanoni
Funder
FAPESP
CNPq
Brazilian Federal Agency for the Support and Evaluation of Graduate Education
Subject
General Computer Science,Theoretical Computer Science
Reference40 articles.
1. Problem E2569;Dweighter;Amer. Math. Monthly,1975
2. 1.375-approximation algorithm for sorting by reversals;Berman,2002
3. Sorting permutations by reversals and Eulerian cycle decompositions;Caprara;SIAM J. Discrete Math.,1999
4. Genome rearrangements and sorting by reversals;Bafna;SIAM J. Comput.,1996
5. Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals;Hannenhalli;J. ACM,1999
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Length-weighted $$\lambda $$-rearrangement distance;Journal of Combinatorial Optimization;2020-11-18