题目：Derandomized Algorithm for Closest String Problem and New Findings for Rearrangement Events
时间：2019年7月15日10:00am – 11:00am.
摘要：In this talk, we will discuss two problems in computational biology, derandomized algorithm for closest string problem and new findings for rearrangement events. For derandomized algorithm for closest string problem, we present the details of a technique that can be used for solve a large set of problems.
Genome rearrangements describe changes in the genetic linkage relationship of large chromosomal regions, involving reversals, transpositions, block interchanges, deletions, insertions, fissions, fusions and translocations etc. Many algorithms for calculating rearrangement scenarios between two genomes have been proposed. Very often, the calculated rearrangement scenario is not unique for the same pair of permutations. Hence, how to decide which calculated rearrangement scenario is more biologically meaningful becomes an essential task.
We will illustrate the new findings for rearrangement events and the new findings may lead to new computational models for genome rearrangement.
报告人简介：Prof. Wang is a professor at Department of Computer Science in City University of Hong Kong. Before joining City University of Hong Kong, he had been a post-doctoral fellow at the University of California at Davis for one year. He has been working in algorithms, bioinformatics, computational biology, networks, and artificial intelligence, and has hundreds of publications on TCBB, Bioinformatics, JCSS, JACM, etc.
He is the associate editor for IEEE/ACM TCBB, BMC Bioinformatics, IJKDB (International Journal of Knowledge Discovery in Bioinformatics), JCSS, also editorial board on JBCB (Journal of Bioinformatics and Computational Biology) and JGO (Journal of Global Optimization).