This preview shows page 1. Sign up to view the full content.
Unformatted text preview: CMSC 423 Homework #3: Due: Nov. 17 at the start of class You may discuss these problems with other students, but you must write up your solutions indepen- dently , without using common notes or worksheets. You must indicate at the top of your homework who you worked with. Your write up should be clear, concise, and neat. You are trying to convince a skeptical reader that your algorithms or answers are correct. Messy or hard-to-read homeworks will not be graded. 1. You are given K strings S 1 ,...,S K of total length n . Define ‘ ( k ) for k = 2 ,...,K to be the length of the longest substring that is common to at least k of the strings S 1 ,...,S K . For example, if the strings are ration , natural , nation , then ‘ (3) = 2 ( at ), ‘ (2) = 5 ( ation ). Give an O ( Kn )-time algorithm to compute ‘ ( k ) for all k = 2 ,...,K . 2. DNA contamination. When sequencing DNA, often contaminant DNA (e.g., bacteria in the lab equipment, the operator’s DNA, etc.) is accidentally sequenced in addition to the target DNA. Supposeequipment, the operator’s DNA, etc....
View Full Document
This note was uploaded on 01/13/2012 for the course CMSC 423 taught by Professor Staff during the Fall '07 term at Maryland.
- Fall '07