Suffix tree and Hidden Markov techniques for pattern analysis

author: Esko Ukkonen, University of Helsinki
published: Feb. 25, 2007,   recorded: October 2005,   views: 9566
Categories

See Also:

Download slides icon Download slides: aop05_ukkonen_sthmt.ppt (793.0┬áKB)


Help icon Streaming Video Help

Related Open Educational Resources

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.
Lecture popularity: You need to login to cast your vote.
  Bibliography

 Watch videos:   (click on thumbnail to launch)

Watch Part 1
Part 1 1:24:06
!NOW PLAYING
Watch Part 2
Part 2 1:13:30
!NOW PLAYING

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:

Comment1 Santanu Chatterjee, January 10, 2009 at 8:59 p.m.:

The camera should point to the slides/screen most of the time...not to the speaker.


Comment2 Ind ia, June 12, 2009 at 10:52 p.m.:

Its irritating to see the speaker when u should be seeing the contents in the slides.


Comment3 Sasa Tomic, November 23, 2011 at 3:08 p.m.:

you can find the slides here:
http://www.cs.helsinki.fi/u/ukkonen/E...

Write your own review or comment:

make sure you have javascript enabled or clear this field: