1. V. Bafna, P.A. Pevzner, Genome rearrangements and sorting by reversals, in: 34th IEEE Symposium on Foundations of Computer Science, (1993, pp. 148–157
2. Sorting by transpositions;Bafna;SIAM Journal on Discrete Mathematics,1998
3. M. Chrobak, P. Kolman, J. Sgall, A greedy algorithm for the minimum common string partition problem, in: Proceedings of 7 International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 04), 2004, pp. 84–95
4. G. Cormode, M. Paterson, S.C. Sahinalp, U. Vishkin, Communication complexity of document exchange, in: Proceedings of the 11th Symposium on Discrete Algorithms, 2000, pp. 197–206
5. G. Cormode, S. Muthukrishnan, The string edit distance problem with moves, in: Proceedings of the 13th Symposium on Discrete Algorithms, 2002, pp. 667–676