Pearson Education Home Higher Education HomeInstructor SupportStudent SupportAbout UsCareers
Bookshop
Texts & Technology
ABOUT THIS PRODUCT
Description
Table of Contents
Features
Appropriate Courses
About the Author(s)
 
RESOURCES
First Day of Class
 
RELATED TITLES
Parallel Algorithms (Computer Science)
Algorithms (Computer Science)
Computing Patterns in Strings
View Larger Cover Image
View Larger Image

William Smyth, Chair, Department of Computer Science and Systems
McMaster University, Canada

Publisher: Addison-Wesley
Copyright: 2003
Format: Paper; 440 pp

ISBN-10: 0201398397
ISBN-13:9780201398397Help icon

Our Price: £49.99
Status: This title is ordered on demand which may result in extended delivery times.

Add this item to my shopping basket

What is Available on Demand?
Available On Demand

Add to Exam Copy BookbagAdd to Exam Copy Bookbag PrintPrint Product Information

Description

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 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 enable the reader to access current state-of-the-art methodology.

 
 
Pearson Education Home