Excerpt from Tight Bounds on the Complexity of the Boyer-Moore Pattern Matching Algorithm
Pattern matching is the problem of finding a pattern of length m in a string of length n; often, all occurences of the pattern are sought. This problem is well studied and is a staple of text books on algorithms (for instance, It is an important subproblem in a number of domains including text editing, symbol manipulation and data retrieval.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
