Publisher
Springer Berlin Heidelberg
Reference14 articles.
1. D. A. Bader, B. M. E. Moret, and M. Yan, A linear-time algorithm for computing inversion distance between signed Permutations with an experimental study, Workshop on Algorithms and Data Structures, 2001, pp. 365–376.
2. V. Bafna and P. A. Pevzner, Genome rearragements und sorting by reversals, SIAM Journal on Computing 25 (1996), no. 2, 272–289.
3. A. Bergeron, A very elementary presentation of the hannenhalli-pevzner theory, CPM (2001), 106–117.
4. A. Bergeron, C. Chauve, T. Hartman, and K. Saint-Onge, On the properties of sequences of reversals that sort a signed Permutation, proceedings of JOBIM, June 2002, pp. 99–108.
5. A. Caprara, Sorting by reversals is difficult, Proceedings of the First International Conference on Computational Molecular Biology (RECOMB), ACM Press, 1997, pp. 75–83.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献