Computing Patterns in Strings - Hardcover

Smyth, William

Hardcover

ISBN 10: 0201398397 ISBN 13: 9780201398397

Publisher: Addison-Wesley, 2003

Synopsis

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. 

About this title

From the Back Cover

A string is just a sequence of letters. But strings can be massive. Plant and animal genomes are strings billions of letters long on the simple alphabet {A,C,G,T}. Internet traffic among billions of websites is a collection of strings that amount to quadrillions of computer bits every day.

Such strings are regularly searched, probably millions of times a day, for patterns of all kinds -- genomic codes for genes and chromosomes, indicators of terrorist activity, and many others. The search for patterns is fundamental to many fields: molecular biology, cryptography, data compression, computer vision, speech recognition, computational geometry.

This book provides a basic general introduction to the algorithms (methods) that efficiently compute patterns in strings. It focuses on results that can be explained with reasonable economy and simplicity, but its 250 references also permit the reader to access current state-of-the-art methodology.

Features

• step-by-step approach

• many illustrative examples

• over 500 exercises to clarify/extend ideas explained in the text

• frequent discussion of current research and applications

This book is ideal for those who have a basic mathematical or computer science background, and who wish to become acquainted with this increasingly important area. Its material is suitable for a senior undergraduate or graduate course in string algorithms.

Bill Smyth is currently Professor Emeritus at McMaster University, Canada and Adjunct Professor at Curtin University, Australia. He is also Visiting Professor at King's College London.

 

About the Author

Bill Smyth is currently teaching at McMaster University, Canada

Edition details

• Publisher: Addison-Wesley
• Publication date: 2003
• ISBN 10: 0201398397
• ISBN 13: 9780201398397
• Binding: Hardcover
• Language: English
• Edition number: 1
• Number of pages: 440