Suffix tree and Hidden Markov techniques for pattern analysis
  • Video is free for view
View_video

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

Author: Esko Ukkonen, University Of Helsinki



Tags: VideoLectures.Net, Machine Learning, Markov Processes, Pattern Recognition, Lectures, Computer Science, Science

Level: advanced Date: October 28, 2008 Votes: 0 User: Dmytro Shteflyuk  Comments:
 
 

1 Response(s) to this entry

Subscribe to comments with RSS.