Jiang T. Some algorithmic challenges in genome-wide ortholog assignment. Journal of Computer Science and Technology, 2010, 25(1): 42-52.
 Caprara A. Sorting by reversals is difficult. In Proc. the 1st International Conference on Research in Computational Molecular Biology, Santa Fe, USA, Jan. 20-23, 1997, pp.75-83.
 Bafna V, Pevzner P. Genome rearrangements and sorting by reversals. SIAM J. Computing, 1996, 25(2): 272-289.
 Christie D. Genome rearrangement problems
[Ph.D. Dissertation]. University of Glasgow, 1998.
 Berman P, Hannenhalli S, Karpinski M. 1.375-approximation algorithm for sorting by reversals. In Proc. the 10th Annual European Symposium on Algorithms, Rome, Italy, Sept. 16-21, 2002, pp.200-210.
 Hannenhalli S, Pevzner P. Transforming cabbage into turnip (polynomial algorithm for sorting signed permutations by reversals). Journal of ACM, 1999, 46(1): 1-27.
 Kaplan H, Shamir R, Tarjan R. A faster and simpler algorithm for sorting signed permutations by reversals. SIAM J. Computing, 1999, 29(3): 880-892.
 Tannier E, Sagot M-F. Sorting by reversals in subquadratic time. In Proc. the 15th Annual Symposium on Combinatorial Pattern Matching, .Istanbul, Turkey, Jul. 5-7, 2004, pp.1-13.
 Bergeron A. A very elementary presentation of the Hannenhalli-Pevzner theory. Discrete Applied Mathematics, 2005, 146(2): 134-145.
 Swenson K, Rajan V, Lin Y, Moret B. Sorting signed permutations by inversions in O (n log n) time. In Proc. the 13th International Conference on Research in Computational Molecular Biology, Tucson, USA, May 18-21, 2009, pp.386-399.
 Hannenhalli S, Pevzner P. To cut ... or not to cut (applications of comparative physical maps in molecular evolution). In Proc. the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, Atlanta, USA, Jan. 28-30, 1996, pp.304-313.
 Bafna V, Pevzner P. Sorting by transpositions. SIAM Journal on Discrete Mathematics, 1998, 11(2): 224-240.
 Hartman T, Shamir R. A simpler and faster 1.5-approximation algorithm for sorting by transpositions. Information and Computation, 2006, 204(2): 275-290.
 Feng J, Zhu D. Faster algorithm for sorting by transpositions and sorting by block-interchanges. ACM Transactions on Algorithms, 2007, 3(3): Article No.25.
 Elias I, Hartman T. A 1.375-approximation algorithm for sorting by transpositions. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2006, 3(4): 369-379.
 Walter M, Dias Z, Meidanis J. Reversal and transposition distance of linear chromosomes. In Proc. String Processing and Information Retrieval, Santa Cruz de La Sierra, Bolivia, Sept. 9-11, 1998, pp.96-102.
 Gu Q, Peng S, Sudborough H. A 2-approximation algorithm for genome rearrangements by reversals and transpositions. Theoretical Computer Science, 1999, 210(2): 327-339.
 Lin G, Xue G. Signed genome rearrangement by reversals and transpositions: Models and approximations. Theoretical Computer Science, 2001, 259(1/2): 513-531.
 Hartman T, Sharan R. A 1.5-approximation algorithm for sorting by transpositions and transreversals. Journal of Computer and System Sciences, 2005, 70(3): 300-320.
 Rahman A, Shatabda S, Hasan M. An approximation algorithm for sorting by reversals and transpositions. Journal of Discrete Algorithms, 2008, 6(3): 449-457.
 Lou X, Zhu D. A 2.25-approximation algorithm for cut-and-paste sorting of unsigned circular permutations. In Proc. the 14th Annual International Computing and Combinatorics Conference, Dalian, China, Jun. 27-29, 2008, pp.331-341.
 Eriksen N. (1+ε)-approximation of sorting by reversals and transpositions. Theoretical Computer Science, 2002, 289(1): 517-529.
 Bader M, Ohlebusch E. Sorting by weighted reversals, transpositions, and inverted transpositions. Journal of Computational Biology, 2007, 14(5): 615-636.
 Bader D, Moret B, Yan M. A linear-time algorithm for computing inversion distance between signed permutations with an experimental study. Journal of Computational Biology, 2001, 8(5): 483-491.