A 2.25-Approximation Algorithm for Cut-and-Paste Sorting of Unsigned Circular Permutations. - Xiaowen Lou; Daming Zhu (COCOON, 2008)

Genome Rearrangement Algorithms for Unsigned Permutations with O(logn) Singletons. - Xiaowen Lou; Daming Zhu (TAMC, 2008)

DNA Algorithm Based on Reverse Complement Alignment for 0/1 Knapsack Problem. - Yamin Zheng; Xiaowen Lou (ICNC (6), 2009)

A new approximation algorithm for cut-and-paste sorting of unsigned circular permutations. - Xiaowen Lou; Daming Zhu (J. Comput. Syst. Sci., 2012)