Please note: In order to keep Hive up to date and provide users with the best features, we are no longer able to fully support Internet Explorer. The site is still available to you, however some sections of the site may appear broken. We would encourage you to move to a more modern browser like Firefox, Edge or Chrome in order to experience the site fully.

String Searching Algorithms, PDF eBook

String Searching Algorithms PDF

Part of the Lecture Notes Series On Computing series

PDF

Please note: eBooks can only be purchased with a UK issued credit card and all our eBooks (ePub and PDF) are DRM protected.

Description

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.

Information

Information