Lecture20 - Algorithms in Systems Engineering IE170 Lecture...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Algorithms in Systems Engineering IE170 Lecture 20 Dr. Ted Ralphs
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
IE170 Lecture 20 1 References for Today’s Lecture Required reading CLRS Chapter 32
Background image of page 2
IE170 Lecture 20 2 String Matching The string-matching problem is to determine whether a given string occurs as part of a larger string. The smaller string is usually called the search pattern . This problem is also referred to as pattern matching . String matching has numerous important applications. Finding words or phrases in large documents (text editors, search engines). Finding the occurrence of a given genetic sequence in a large genome.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
IE170 Lecture 20 3 Terminology The set of allowable characters will be denoted Σ (usually the ASCII characters. The set of strings composed of these characters is denoted Σ * . For convenience, we will view a given string as an array of members of Σ . As in previous settings, we may also convert strings to integers in order to work with them more efficiently. Let
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/29/2008 for the course IE 170 taught by Professor Ralphs during the Spring '07 term at Lehigh University .

Page1 / 9

Lecture20 - Algorithms in Systems Engineering IE170 Lecture...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online