Image from Google Jackets

String searching algorithms [electronic resource] / Graham A. Stephen.

By: Contributor(s): Series: Lecture notes series on computing ; v. 3.Publication details: Singapore ; River Edge, N.J. : World Scientific Pub. Co., c1994.Description: 1 online resource (xii, 243 p.) : illISBN:
  • 9789814317368
Subject(s): Genre/Form: DDC classification:
  • 005.74 22
Online resources:
Contents:
1. Introduction -- 2. String matching. 2.1. Overview. 2.2. Algorithms in detail. 2.3. Further reading -- 3. String distance and common sequences. 3.1. Overview. 3.2. Algorithms in detail. 3.3. Further reading -- 4. Suffix trees. 4.1. Overview. 4.2. Algorithms in detail. 4.3. Further reading -- 5. Approximate string matching. 5.1. Overview. 5.2. Algorithms in detail. 5.3. Further reading -- 6. Repeated substrings. 6.1. Overview. 6.2. Algorithms in detail.
Summary: 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.
No physical items for this record

Includes bibliographical references (p. 211-233) and index.

1. Introduction -- 2. String matching. 2.1. Overview. 2.2. Algorithms in detail. 2.3. Further reading -- 3. String distance and common sequences. 3.1. Overview. 3.2. Algorithms in detail. 3.3. Further reading -- 4. Suffix trees. 4.1. Overview. 4.2. Algorithms in detail. 4.3. Further reading -- 5. Approximate string matching. 5.1. Overview. 5.2. Algorithms in detail. 5.3. Further reading -- 6. Repeated substrings. 6.1. Overview. 6.2. Algorithms in detail.

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.

Electronic reproduction. Singapore : World Scientific Publishing Co., 1994. System requirements: Adobe Acrobat Reader. Mode of access: World Wide Web.

There are no comments on this title.

to post a comment.