Computing Patterns in Strings, 1st edition

  • William Smyth

Unfortunately, this item is not available in your country.

Overview

The computation of patterns in strings is a fundamental requirement in many areas of science and information processing.  The operation of a text editor, the lexical analysis of a computer program, the functioning of a finite automaton, the retrieval of information from a database - these are all activities which may require that patterns be located and computed.   In other areas of science, the algorithms that compute patterns have applications in such diverse fields as data compression, cryptography, speech recognition, computer vision, computational geometry and molecular biology. 

Table of contents

Preface
PART I  STRINGS AND ALGORITHMS
1. Properties of Strings
2. Patterns?  What Patterns?
3. Strings, Famous and Infamous
4. Good Algorithms and Good Test Data
PART II  COMPUTING INTRINSIC PATTERNS
5. Trees Derived from Strings
6. Decomposing a String
PART III  COMPUTING SPECIFIC PATTERNS 7. Basic Algorithms
8. Son of BM Rides Again!
9. String Distance Algorithms
10. Approximate Pattern-Matching
11. Regular Expressions and Multiple Patterns
PART IV  COMPUTING GENERIC PATTERNS
12. Repetitions (Periodicity)
13. Extensions of Periodicity

For teachers

All the material you need to teach your courses.

Discover teaching material

Published by Pearson (April 8th 2003) - Copyright © 2003