Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology

[From the Back Cover]

Algorithms on text (strings) have long been studied in computer scuence, and computation on molecular sequence data (strings) is at the heart of computational molecular biology. Present and potential algorithms for string computation provide a significant intersection between computer science and molecular biology.

This book is a general, rigorous treatment of algorithms that operate on character strungs and sequences. It covers a wide spectrum of string algorithms from classical computer science to modern molecular biology and, when possible, integrates those two fields.

In addition to explaining current algorithms, the book emphasizes fundamental ideas and techniques that are central in today‘s applications and should lead to new techniques, in the future. The book contains new approaches developed for complex material, simplifying methods that have been previously for the specialist alone. Biological problems are discussed in detail to explain the reasons that many biological questions have been productwely cast as string problems.

The book is written for graduate or advanced undergraduate student in computer science, or computational biology, or bio-informatics. It can be used as a main text for courses on strung algorithms. or for computer science oriented courses on computational biology and is also a reference for professionals. The book contains over 400 exercises to reinforce presented material, and to develop additional topics.