Suffix tree and Hidden Markov techniques for pattern analysis
published: Feb. 25, 2007, recorded: October 2005, views: 9567
Report a problem or upload filesIf 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.
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 pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !