This preview shows page 1. Sign up to view the full content.
Unformatted text preview: match,-1 for mismatch, and gap extension,-3 for gap-open. Compare your results for the case when gap open penalty is 0. 7. How much space do the alignment algorithms need? Suppose you want to nd all regions of the human genome that matched to some other location on the human genome. Describe in words, and approach to computing this. Present a rough calculation on how much memory your computer needs to have to allow this computation. 8. When you are computing sequence alignments for assembling DNA, local and global alignments are not quite what you need. Instead you need to align a prex of a string to a sux of another string. Design an algorithm to compute optimal prex sux alignments between two strings. 9. What is the genetic code? How does Blast align a DNA string to a protein string?...
View Full Document
- Fall '06