Title:  Randomized Algorithms for Motif Detection
Speaker: Wang Lusheng
CityU

Date: Friday, March 11, 2005
Time 11-12
Venue: Room 4480, HKUST
Near lifts 25-26


Abstract
Motif detection is an important problem that has  many applications such as
finding targets for potential drugs, design of diagnostic probes, PCR
primers design etc.  The problem
can be described as follows: Given two groups of sequences B and G, find a
length-L string  that appears in every  sequence in B and does not
appear in anywhere of the sequences in G. When errors are allowed, the
problem is NP-hard.

In this talk, we will discuss theoretical algorithms  as well as practical
software on this topic.