University

College of
Montgomery

Pattern Searching
By using
Boyer Moore Algorithm
Artificial Intelligence (CSI-502)
BS (Computer Science)
6th Semester

Presented to: Madam Shaheen

Presented by: Usman Jeven
4th July, 2022
Topic:
Pattern Search by using Boyer Moore Algorithm

Text String:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
t r e e s g r e e n t r e e s

Pattern String:
0 1 2 3 4
t r e e s

There are three steps for searching patterns string from text string in Boyer Moore
Algorithm
1. Construction of Bad Match Table.
2. Compare pattern and text strings from right to left.
3. If mis-match occurs shift the pattern string to right according to the value of mis-
matching letter in text string in Bad Match Table.

Text String:
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
t r e e s g r e e n t r e e s

Pattern String:
0 1 2 3 4
t r e e s

Length (pattern) = 5
B.M.T value = Length (pattern) – Index number – 1
B.M.T value (t)= 5–0–1 = 4
B.M.T value (r)= 5–1–1 = 3
B.M.T value (e)= 5 – 2 – 1 = 2
B.M.T value (e)= 5 – 3 – 1 = 1
B.M.T value (s)= 5–4–1 = 0
 Bad Match Table

letters t r e s *
value 4
4
3
3
2
1
0
5
5
5

We start matching text string and pattern string from right most letter of pattern
string if the right most letter of pattern string matched with corresponding letter in text
string then we check the second letter from right and then so on till first letter of
pattern string.

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
t r e e s g r e e n t r e e s
t r e e s

Both pattern string and text string are completely matched at the index “0”.
Now we check next part of text string.
“s” has value 5 in BMT so we go 5 steps forward.
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
t r e e s g r e e n t r e e s
t r e e s
t r e e s

“e” has value 5 in BMT so we go 1 steps forward.

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
t r e e s g r e e n t r e e s
t r e e s
t r e e s
t r e e s

“n” not present in BMT so we go 5 steps forward according to * value

0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
t r e e s g r e e n t r e e s
t r e e s
t r e e s
t r e e s
t r e e s
“e” has value 5 in BMT so we go 1 steps forward.
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
t r e e s g r e e n t r e e s
t r e e s
t r e e s
t r e e s
t r e e s
t r e e s

So we got two indexes where pattern string completely matches.

Output:
Pattern match at index “0”
Pattern match at index “12”