Suffix tree and Hidden Markov techniques for pattern analysis
author:
Esko Ukkonen,
University of Helsinki
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
Categories
Top: Computer Science: Machine Learning: Markov ProcessesTop: Computer Science: Machine Learning: Pattern Recognition
You might be experiencing some problems with Your Video player.
SEE ALSO:
Download slides:
aop05_ukkonen_sthmt.ppt (793.0 KB)
Launch in a standalone WM Player
Streaming Video Help
Windows Media Player Firefox Plugin - Download
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
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.
Related content
Visitors who watched this lecture also watched...
1 comment
Watch videos: (click on thumbnail to launch)
Part 1
1:24:06
|
Part 2
1:13:30
|
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !
