Scribd
Upload
326 views

String Matching Algorithm

The document discusses different algorithms for pattern matching in strings, including brute force, Knuth-Morris-Pratt (KMP), and Boyer-Moore algorithms. KMP improves on brute force by shifting the pattern more intelligently using a failure function. Boyer-Moore further optimizes shifting using character-jump heuristics like a last occurrence function. Both KMP and Boyer-Moore run in linear time compared to brute force's quadratic time, with Boyer-Moore generally performing best on real text.

Uploaded by

Manohar NV
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
326 views

String Matching Algorithm

The document discusses different algorithms for pattern matching in strings, including brute force, Knuth-Morris-Pratt (KMP), and Boyer-Moore algorithms. KMP improves on brute force by shifting the pattern more intelligently using a failure function. Boyer-Moore further optimizes shifting using character-jump heuristics like a last occurrence function. Both KMP and Boyer-Moore run in linear time compared to brute force's quadratic time, with Boyer-Moore generally performing best on real text.

Uploaded by

Manohar NV
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 14

Pattern Matching

a a b b a a a b c c a a a
4

a
1

b
3 2

Pattern Matching

Outline
Strings Pattern matching algorithms

Brute-force algorithm Boyer-Moore algorithm Knuth-Morris-Pratt algorithm

Pattern Matching

Strings
A string is a sequence of characters Examples of strings:

Let P be a string of size m

Java program HTML document DNA sequence Digitized image

An alphabet S is the set of possible characters for a family of strings Example of alphabets:

A substring P[i .. j] of P is the subsequence of P consisting of the characters with ranks between i and j A prefix of P is a substring of the type P[0 .. i] A suffix of P is a substring of the type P[i ..m - 1]

ASCII Unicode {0, 1} {A, C, G, T}

Given strings T (text) and P (pattern), the pattern matching problem consists of finding a substring of T equal to P Applications:

Pattern Matching

Text editors Search engines Biological research

Brute-Force Algorithm
Algorithm BruteForceMatch(T, P) Input text T of size n and pattern P of size m Output starting index of a substring of T equal to P or -1 if no such substring exists a match is found, or for i 0 to n - m all placements of the pattern { test shift i of the pattern } have been tried j0 Brute-force pattern matching while j < m T[i + j] = P[j] runs in time O(nm) jj+1 Example of worst case: if j = m T = aaa ah P = aaah return i {match at i} may occur in images and else DNA sequences break while loop {mismatch} unlikely in English text return -1 {no match anywhere} The brute-force pattern matching algorithm compares the pattern P with the text T for each possible shift of P relative to T, until either
Pattern Matching 4

The KMP Algorithm - Motivation


Knuth-Morris-Pratts algorithm compares the pattern to the text in left-to-right, but shifts the pattern more intelligently than the brute-force algorithm. When a mismatch occurs, what is the most we can shift the pattern so as to avoid redundant comparisons? Answer: the largest prefix of P[0..j] that is a suffix of P[1..j]
. .

a b a a b x .

a b a a b a j a b a a b a

No need to repeat these comparisons

Resume comparing here


5

Pattern Matching

KMP Failure Function


Knuth-Morris-Pratts algorithm preprocesses the pattern to find matches of prefixes of the pattern with the pattern itself The failure function F(j) is . defined as the size of the largest prefix of P[0..j] that is also a suffix of P[1..j] Knuth-Morris-Pratts algorithm modifies the bruteforce algorithm so that if a mismatch occurs at P[j] T[i] we set j F(j - 1)
j P [j ] F(j)
.

0 a 0

1 b 0

2 a 1

3 a 1
.

4 b 2
.

5 a 3
. .

a b a a b x .

a b a a b a j a b a a b a F(j - 1)
6

Pattern Matching

The KMP Algorithm


The failure function can be represented by an array and can be computed in O(m) time At each iteration of the whileloop, either

i increases by one, or the shift amount i - j increases by at least one (observe that F(j - 1) < j)

Hence, there are no more than 2n iterations of the while-loop Thus, KMPs algorithm runs in optimal time O(m + n)

Algorithm KMPMatch(T, P) F failureFunction(P) i0 j0 while i < n if T[i] = P[j] if j = m - 1 return i - j { match } else ii+1 jj+1 else if j > 0 j F[j - 1] else ii+1 return -1 { no match }
7

Pattern Matching

Computing the Failure Function


The failure function can be represented by an array and Algorithm failureFunction(P) can be computed in O(m) time F[0] 0 i1 The construction is similar to j0 the KMP algorithm itself while i < m At each iteration of the whileif P[i] = P[j] {we have matched j + 1 chars} loop, either

i increases by one, or the shift amount i - j increases by at least one (observe that F(j - 1) < j)

Hence, there are no more than 2m iterations of the while-loop


Pattern Matching

F[i] j + 1 ii+1 jj+1 else if j > 0 then {use failure function to shift P} j F[j - 1] else F[i] 0 { no match } ii+1
8

Example
a b a c a a b a c c a b a c a b a a b b
1 2 3 4 5 6

a b a c a b
7

a b a c a b
8 9 10 11 12

a b a c a b
13
j
P [j ] F(j)

0
a 0

1
b 0

2
a 1

3
c 0

4
a 1

5
b 2

a b a c a b
14 15 16 17 18 19

a b a c a b
9

Pattern Matching

Boyer-Moore Heuristics
The Boyer-Moores pattern matching algorithm is based on two heuristics Looking-glass heuristic (right-to-left matching): Compare P with a subsequence of T moving backwards Character-jump heuristic (bad character shift rule): When a mismatch occurs at T[i] = c

If P contains c, shift P to align the last occurrence of c in P with T[i] Else, shift P to align P[0] with T[i + 1]
p a t 1 t h m 2 t h m t e r n m a t c h i n g 3 t h m 4 t h m a l g o r 5 t h m i t h m

Example
a 11 10 9 8 7 r i t h m 6 t h m
10

r i

r i

Pattern Matching

Last-Occurrence Function
Boyer-Moores algorithm preprocesses the pattern P and the alphabet S to build the last-occurrence function L mapping S to integers, where L(c) is defined as

the largest index i such that P[i] = c or -1 if no such index exists

Example:

S = {a, b, c, d}
P = abacab

c
L (c )

a
4

b
5

c
3

d
-1

The last-occurrence function can be represented by an array indexed by the numeric codes of the characters The last-occurrence function can be computed in time O(m + s), where m is the size of P and s is the size of S

Pattern Matching

11

The Boyer-Moore Algorithm


Algorithm BoyerMooreMatch(T, P, S) L lastOccurenceFunction(P, S ) im-1 jm-1 repeat if T[i] = P[j] if j = 0 return i { match at i } else ii-1 jj-1 else { character-jump } l L[T[i]] i i + m min(j, 1 + l) jm-1 until i > n - 1 return -1 { no match }

Case 1: j 1 + l
. . . . . .

a . i

b a j l m-j
.

b a

Case 2: 1 + l j
. . . . . .

a . i

a . l

b . j m - (1 + l) a .
.

b .
12

Pattern Matching

1+l

Example
a a b a b a c c a a
1

a d

b a

a b

a b b

a b
4 3 2 13 12 11 10 9 8

a b a a b a

c a

a c

b
5

a b
6

b a a c

c a

a b
7

a c

b a

a b

Pattern Matching

13

Analysis
Boyer-Moores algorithm runs in time O(nm + s) Example of worst case:

a
6

a
5

a
4

a
3

a
2

a
1

T = aaa a P = baaa

a b

a a b

a a a b

a
9

a
8 7

The worst case may occur in images and DNA sequences but is unlikely in English text Boyer-Moores algorithm is significantly faster than the brute-force algorithm on English text

12 11 10

a a a

a a a

a a a a a a

18 17 16 15 14 13 24 23 22 21 20 19

Pattern Matching

14

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy