Home Sitemap Contact 中文 CAS
  • HOME
  • About Us
  • Research
  • People
  • International Cooperation
  • News
  • Education & Training
  • Join Us
  • Publications
  • Papers
  • Resources
  • Life at ICT
  • Links
  • Location:Home>News>Upcoming Events
    Algorithms for the closest string and the shared center problems
    Update time: 2012-05-15
    Text Size: A A A
    Speaker: Prof. Lusheng Wang, City University of Hong Kong
    Time: 13:00pm—14:00pm, May 15th, 2012 (Tuesday)
    Place: Room1234, 12th Floor, ICT, CAS
    In this talk, we will discuss some fixed parameter algorithms for the closest string problem and the shared center problem. The closest string problem has applications in motif detection, PCR primer design etc. The shared center problem is formulated to solve the mutation region detection problem.

    Lusheng Wang is a professor in department of computer science, City University of Hong Kong. He serves as the associate editor for BMC Bioinformatics, IJKDB, and on the editorial board of Journal of Bioinformatics and Computational Biology, and Journal of Global Optimization. His research interests include Bioinformatics, Computational Molecular Biology, Networks, and Steiner trees.

    Center for Advanced Computing Research, ICT
    May, 2012


    Address :No.6 Kexueyuan South Road Zhongguancun,Haidian District Beijing,China
    Postcode :100190 Tel : (8610)62601166 Email : office@ict.ac.cn