Knuth-Morris-Pratt Search vs Boyer-Moore Search

Posted 2020-11-12 每天更强一点...

Reference

[1] https://stackoverflow.com/questions/12656160/what-are-the-main-differences-between-the-knuth-morris-pratt-and-boyer-moore-sea?utm_medium=organic&utm_source=google_rich_qa&utm_campaign=google_rich_qa

[2] http://www.cs.utexas.edu/~moore/best-ideas/string-searching/kpm-example.html

[3] http://www.cs.utexas.edu/~moore/best-ideas/string-searching/fstrpos-example.html

Boyer-Moore‘s approach is to try to match the last character of the pattern instead of the first one with the assumption that if there‘s not match at the end no need to try to match at the beginning. This allows for "big jumps" therefore BM works better when the pattern and the text you are searching resemble "natural text" (i.e. English)

Knuth-Morris-Pratt searches for occurrences of a "word" W within a main "text string" S by employing the observation that when a mismatch occurs, the word itself embodies sufficient information to determine where the next match could begin, thus bypassing re-examination of previously matched characters. (Source: Wiki)

This means KMP is better suited for small sets like DNA (ACTG)

Boyer-Moore technique match the characters from right to left, works well on long patterns. knuth moris pratt match the characters from left to right, works fast on short patterns.