Author Description

Excerpt from Efficient Parallel and Serial Approximate String Matching We give a first parallel algorithm for the k-differences problem. The algorithm has three main parts: I. Analysis of the pattern. II. Analysis of the text. III. Finding all occurrences of the pattern in the text with at most k differences. 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.