Trees, Arrays, Networks and Optimization for Finding Patterns in Biological Sequences
published: Feb. 25, 2007, recorded: November 2005, views: 373
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.
a) The use of suffix trees and integer programming for finding optimal virus signatures. b) A current treatment of suffix-arrays and their uses. In the last several years simple linear-time algorithms for building suffix arrays have been developed making explicit suffix-trees mostly obsolete. c) Algorithms for finding signatures (patterns) of historical recombination and gene-conversion in SNP (binary) sequences. The techniques here relate to graph-theory.
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !