Complexity and Approximation of the Minimum Recombination Haplotype Configuration Problem. - Lan Liu 001; Xi Chen 001; Jing Xiao; Tao Jiang 001 (ISAAC, 2005)

Fast elimination of redundant linear equations and reconstruction of recombination-free mendelian inheritance on a pedigree. - Jing Xiao; Lan Liu 001; Lirong Xia; Tao Jiang 001 (SODA, 2007)

Complexity and approximation of the minimum recombinant haplotype configuration problem. - Lan Liu 001; Xi Chen 001; Jing Xiao; Tao Jiang 001 (Theor. Comput. Sci., 2007)

Deconvoluting BAC-Gene Relationships Using a Physical Map. - Yonghui Wu; Lan Liu 001; Timothy J. Close; Stefano Lonardi (J. Bioinform. Comput. Biol., 2008)

On the minimum common integer partition problem. - Xin Chen 037; Lan Liu 001; Zheng Liu; Tao Jiang 001 (ACM Trans. Algorithms, 2008)

Efficient Algorithms for Reconstructing Zero-Recombinant Haplotypes on a Pedigree Based on Fast Elimination of Redundant Linear Equations. - Jing Xiao; Lan Liu 001; Lirong Xia; Tao Jiang 001 (SIAM J. Comput., 2009)

Efficient Genome-Wide TagSNP Selection Across Populations via the Linkage Disequilibrium Criterion. - Lan Liu 001; Yonghui Wu; Stefano Lonardi; Tao Jiang 001 (J. Comput. Biol., 2010)

A linear-time algorithm for reconstructing zero-recombinant haplotype configuration on pedigrees without mating loops. - Lan Liu 001; Tao Jiang 001 (J. Comb. Optim., 2010)