Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference8 articles.
1. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study;Bader;J. Comput. Biol.,2001
2. P. Berman, S. Hannenhalli, Fast Sorting by Reversal, CPM 1996, Lecture Notes in Comput. Sci., vol. 1075, Springer, Berlin, 1996, pp. 168–185.
3. A. Caprara, Sorting by Reversals is Difficult, RECOMB 1997, ACM Press, New York, 1997, pp. 75–83.
4. Transforming cabbage into turnip;Hannenhalli;J. Assoc. Comput. Mach.,1999
5. A faster and simpler algorithm for sorting signed permutations by reversals;Kaplan;SIAM J. Comput.,1999
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献