Title: | Improved algorithms for DNA motif detection and their application |
Speaker: |
Christina Boucher
University of Waterloo, ON, Canada |
Abstract |
Improving the accuracy and efficiency of motif recognition is an important
computational challenge that has application to detecting transcription factor
binding sites in genomic data. Closely related to motif recognition is the
closest string decision problem that asks, given a parameter $d$ and a set of
$\ell$-length strings $S = \{s_1, \ldots, s_n\}$, whether there exists a
consensus string that has Hamming distance at most $d$ from any string in
$S$. We focus on the development of a method for solving the closest string
problem quickly with a small probability of error. We apply this heuristic to
develop a new motif recognition program, sMCL-WMR, which has impressive
accuracy and efficiency. |