Friday

July 11, 2014

July 11, 2014

Posted by **JayLQue** on Wednesday, April 20, 2011 at 9:20am.

6. Build the Boyer-Moore last table for the following pattern/alphabet pairs.

(a) “giggling”’ {g, I, l, n}

(b) “mimimi” , {i, m}

(b) ANSWER: i m

6 5

14. Search for the pattern “pie” in the text “pickled peppers”.

Create a table like that used in Example 4.31 and count hits and misses.

Graph paper would be helpful.

(a) Use the obvious algorithm.

(b) Use the KMP algorithm.

(d) Use Boyer-Moore with only the shift table.

- Discrete Math -
**MathMate**, Friday, April 22, 2011 at 7:53pmHere are some links to help you:

The Boyles-Moore algorithm

http://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string_search_algorithm

KMP algorithm:

http://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm

**Related Questions**

Math - Help, I can't find the pattern rule for this sequence(eg. -6,-3,2,9,18 ...

8th grade math - The following pattern continues indefinitely. ...

math - The following pattern continues indefinitely. REPEATREPEATREPEAT… 1) What...

math - The following pattern continues indefinitely: REPEATREPEATREPEAT 1) What ...

english - Which pattern is most effective to deliver a persuasive message when ...

poetry titles? - I got an assignment to make up my own poem following the same ...

math - Kurt used the rule add 4, subtract 1 to generate a pattern. The first ...

Algebra - Which of the following methods can be used to construct a pattern of ...

Algebra 2 - Which of the following methods can be used to construct a pattern of...

algebra 2 - At a flea market held each weekend, an artist sells handmade ...