Selected Presentations
  1. An Algorithm for Computing the Gene Tree Probability under the Multispecies Coalescent and its Application in the Inference of Population Tree, ISMB 2016, Orlando, FL, July 2016.
  2. A simple method for de novo assembly of highly repetitive genomic regions from sequence reads, (on the preliminary results related to REPdenovo) talk given by Chong Chu, Genome 10k meeting, March 2015.
  3. A Coalescent-based Method for Population Tree Inference with Haplotypes, Cold Spring Harbor Asia, Suzhou, China, Oct. 8 to 12, 2014.
  4. Algorithms and applications of likelihood computation under multi-species coalescent, invited talk in Workshop on Coalescent Theory: New Developments and Applications, Montreal, QC, Canada, October 7-11, 2013.
  5. An Algorithm for Constructing Parsimonious Hybridization Networks with Multiple Phylogenetic Trees, RECOMB 2013, Beijing, China. April 7 to 10, 2013.
  6. An improved approach for accurate and efficient calling of structural variations with low-coverage sequence data, talk give by Jin Zhang, Second Annual RECOMB Satellite Workshop on Massively Parallel Sequencing, April 19-20 2012, Barcelona, Spain.
  7. Coalescent-based Species Tree Inference from Gene Tree Topologies Under Incomplete Lineage Sorting by Maximum Likelihood (video link from Newton Institute), Phylogenetics: New data, new Phylogenetic challenges, Follow-up Meeting, June 23, 2011, Isaac Newton Institute for Mathematical Sciences, Cambrige, UK.
  8. Finding Deletions with Exact Break Points from Noisy Low Coverage Paired-end Short Sequence Reads, talk given by Jin Zhang, short talk, First Annual RECOMB Satellite Workshop on Massively Parallel Sequencing, March 26-27 2011, Vancouver, BC, Canada. This talk was also given in 7th International Symposium on Bioinformatics Research and Applications (ISBRA), May 27-29 2011, ChangSha, Hunan Prov., China.
  9. Close lower and upper bounds for the minimum reticulate network of multiple phylogenetic trees, ISMB 2010, Boston, MA, July 2010. [Paper]
  10. Inferring Evolutionary History with Network Models in Population Genomics: Challenges and Progress, Structure Discovery in Biology: Motifs, Networks & Phylogenies, Dagstuhl, Germany, June 2010.
  11. Bounds on the Minimum Mosaic of Population Sequences under Recombination, CPM 2010, NYU-Poly, June 2010. [Paper]
  12. Fast Computation of the Exact Hybridization Number of Two Phylogenetic Trees, talk given by J. Wang at International Symposium on Bioinformatics Research and Applications (ISBRA 2010), Storrs, CT, May 2010. [Paper]
  13. Exact Computation of Coalescent Likelihood Under the Infinite Sites Model, International Symposium on Bioinformatics Research and Applications (ISBRA 2009), Ft. Lauderdale, FL, May 2009. [Paper]
  14. Exact Computation of Coalescent Likelihood Under the Infinite Sites Model, DIMACS Workshop on Algorithms in Human Population Genomics, Rutgers University, April 2009.
  15. Inference of Genealogies for Recombinant SNP Sequences in Populations, SoE-UCHC Bioengineering Research Forum, University of Connecticut Health Center, Oct. 2008.
  16. Inference of Complex Genealogical Histories in Populations and Applications in Mapping Complex Traits, Workshop on Computational Issues in Genetic Epidemiology, Rutgers University, Augest 2008.
  17. Inferring Local Tree Topologies for SNP Sequences Under Recombination in a Population, Mathematics and Informatics in Evolution and Phylogeny Conference (link), Montpelier, France, June 2008.
  18. Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants, CPM 2007, London, Canada, July, 2007. [Paper]
  19. Association Mapping of Complex Diseases with Ancestral Recombination Graphs: Models and Efficient Algorithms, RECOMB 2007, San Francisco Bay Area, CA, Apr. 2007. [Paper] 
  20. Algorithms for Association Mapping of Complex Diseases with Ancestral Recombination Graphs, 3rd RECOMB Satellite Workshop on Computational Methods for SNPs and Haplotypes, University of Southern California, CA. Jan. 2007.
  21. Efficient Computation of Minimum Recombination over Genotypes (not Haplotypes), Life Sciences Society Computational Systems Bioinformatics (CSB) 2006, Stanford, CA, Aug. 2006. [Paper]
  22. Algorithms for Imperfect Phylogeny Haplotyping with a Single Homoplasy or Recombination Event, Workshop on Algorithm of Bioinformatics (WABI) 2005, Mallorca, Spain, Oct. 2005. [Paper]