String Searching Algorithms

This volume contains contributions by experts which cover a range of topics in semigroups theory. Some of the articles exhibit the strong links with theoretical computer science. Several survey articles summarize the salient features of special fields or the theory of particular interest in the contemporary research. Special care has been taken in the presentation of the papers, seeking to make them accessible to a wide audience String searching is a subject of both theoretical and practical interest in computer science. This book presents a bibliographic overview of the field and an anthology of detailed descriptions of the principal algorithms available. The aim is twofold: on the one hand, to provide an easy-to-read comparison of the available techniques in each area, and on the other, to furnish the reader with a reference to in-depth descriptions of the major algorithms. Topics covered include methods for finding exact and approximate string matches, calculating ‘edit’ distances between strings, finding common sequences and finding the longest repetitions within strings. For clarity, all the algorithms are presented in a uniform format and notation. A bibliographic overview of string searching and an anthology of detailed descriptions of the principal algorithms available. Topics covered include methods for finding exact and approximate string matches, calculating "edit" distances between strings; and finding common sequences.