This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: IE 170 Laboratory 9: String Matching Dr. T.K. Ralphs Scott Denegre Ashutosh Mahajan Due April 17, 2006 1 Laboratory Description and Procedures 1.1 Learning Objectives You should be able to do the following after completing this laboratory. 1. Understand the basic principles of string matching. 2. Understand how preprocessing works. 1.2 Key Words 1. string matching 2. modular arithmetic 3. preprocessing 4. string 5. prefix function 1.3 Scenario You just received a summer job working in a genetics laboratory in Philadelphia. Your boss tells you that he has discovered a way to alter yeast to make beer taste even better, while having a stronger effect on your system. Your job is to write a program that your boss can use to find all the instances of a particular pattern in the yeast’s gene, so he can more effectively analyze the organism and improve the lives of beer drinkers across the globe. If you can accomplish this, you will receive a large raise, in liquid form, and be able to impress all your friends with your summer endeavors when you return to campus in the fall. 1.4 Designing and Analyzing the Algorithm In this lab, you must implement three different string matching algorithms in order to perform the type of search described above. The user will have the option of searching for a desired string or giving an input file as an argument. The primary focus of the analysis, in this lab, is to comparegiving an input file as an argument....
View Full Document
This note was uploaded on 08/06/2008 for the course IE 170 taught by Professor Ralphs during the Spring '07 term at Lehigh University .
- Spring '07
- Systems Engineering