This preview shows page 1. Sign up to view the full content.
Unformatted text preview: S = {ATG, GGG, GGT, GTA, GTG, TAT, TGG} Label edges and vertices of the graph, and give all possible sequences s such that Spectrum ( s , 3) = S [25 points] 4. DNA sequencing reads contain errors that lead to complications in fragment assembly. Fragment assembly with sequencing errors motivates the Shortest kapproximate Superstring problem: Given a set of strings S = ( S 1 , S 2 , ,S t ) find a shortest string s such that each string in S matches some substring of s with at most k errors. [25 points]...
View Full
Document
 Spring '08
 Staff

Click to edit the document details