Suffix tree and Hidden Markov techniques for pattern analysis

Posted in Science on October 28, 2008


Suffix tree and Hidden Markov techniques for pattern analysis

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

Watch Video

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