Publications in Computational Biology and Bioinformatics

1.  Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants (pdf), Yufeng Wu and Dan Gusfield, in Proceedings of CPM 2007, to appear. [Software]
   
2.  A New Recombination Lower Bound and The Minimum Perfect Phylogenetic Forest Problem, Yufeng Wu and Dan Gusfield, in Proceedings of COCOON 2007, to appear,
3.   Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms (pdf), Yufeng Wu, in Proceedings of RECOMB 2007 (LNBI Vol. 4453), pages 488-502, 2007. This paper wins the best student paper award. [Software]
4.   Efficient Computation of Minimum Recombination over Genotypes (not Haplotypes) (pdf), Yufeng Wu and Dan Gusfield, Proceedings of  Life Sciences Society Computational Systems Bioinformatics (CSB) 2006, pages 145-156, 2006.   [Abstract] [Talk].  An extended version of this paper is invited to Journal of Bioinformatics and Computational Biology (JBCB) in a special issue of CSB 2006, to appear.
5.   Algorithms to distinguish the role of gene-conversion from single-crossover recombination in the derivations of SNP sequences in populations (pdf), Yun S. Song, Zhihong Ding, Dan Gusfield, Charles Langley and Yufeng Wu, Proceedings of RECOMB 2006 (LNBI Vol. 3909), pages 231-245, 2006. An extended version of this paper is invited to Journal of Computational Biology (JCB) in a special issue of RECOMB 2006, under review.
6.   Algorithms for Imperfect Phylogeny Haplotyping with a Single Homoplasy or Recombination Event (pdf), Yun S. Song, Yufeng Wu and Dan Gusfield, Proceedings of Workshop on Algorithm of Bioinformatics (WABI) 2005, LNCS 3692, 2005.    [Talk].
7.   Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution, Yun S. Song, Yufeng Wu and Dan Gusfield, Proceedings of ISMB 2005, published as a special issue of Bioinformatics, 21: i413 - i422, 2005.