Speaker: Kaur Ramandeep
Day:  Wednesday, 12/14/2005
Room: ITEB 201
Time: 3:30pm
Title: Finding Subtle Motifs by Branching from Sample Strings

Abstract:
The goal of motif finding is to find an unknown motif with approximate
occurrences at unknown positions in a sample of DNA sequences. Some motif
finding algorithms carry out this search in the space of possible starting
positions of all motif occurrences in the sample, while others search the
space of all possible motifs described by a given model.

The paper "Finding Subtle Motifs by Branching from Sample Strings" by Alkes
Price, Sriram Ramabhadran and Pavel Pevzner, gives two algorithms: Pattern
Branching an Profile Branching. In both the algorithms they are using a new
approach, which searches motif space by branching from sample strings.

Based on the paper:
"Finding Subtle Motifs by Branching from Sample Strings"  by Alkes Price,
Sriram Ramabhadran and Pavel Pevzner.