报告题目：Models and algorithms in genome assembly
报告人：Yu Lin博士(澳大利亚Australian National University)
The recent breakthroughs in assembling long error-prone reads (generated by third-generation sequencing) were based on the overlap-layout-consensus approach and did not utilize the strengths of the alternative de Bruijn graph approach to genome assembly. In this talk, I will show how to generalize the de Bruijn graph model to assemble long error-prone reads and describe new algorithms that result in more accurate genome reconstructions than the existing state-of-the-art algorithms. Moreover, the new graph model can also be applied to improving assemblies for second-generation sequencing, bridging the analysis of genome assembly, genome rearrangements and segmental duplications in the human genome.
Yu Lin is a lecturer and group leader at the Research School of Computer Science, the Australian National University. Prior to this, he was a postdoctoral scholar, hosted by Prof Pavel Pevzner at the Department of Computer Science and Engineering, University of California, San Diego. He received his PhD in Computer Science under Prof Bernard Moret from École Polytechnique Fédérale de Lausanne (EPFL), Switzerland. His research focuses on computational biology, and he has been working on algorithms for genome assembly, the analysis of genome rearrangements, and phylogenetic reconstruction.