Suffix tree and Hidden Markov techniques for pattern analysis
author: Esko Ukkonen,
University of Helsinki
published: Feb. 25, 2007, recorded: October 2005, views: 9567
published: Feb. 25, 2007, recorded: October 2005, views: 9567
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
Suffix tree construction. Mention the new linear time array constructions - - using suffix trees for finding motifs with gaps (some new observations: 0.5 - 1 hours). - finding cis-regulatory motifs by comparative genomics (1 hour) - Hidden Markov techniques for haplotyping
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
Reviews and comments:
The camera should point to the slides/screen most of the time...not to the speaker.
Its irritating to see the speaker when u should be seeing the contents in the slides.
you can find the slides here:
http://www.cs.helsinki.fi/u/ukkonen/E...
Write your own review or comment: