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

Front Cover
Cambridge University Press, May 28, 1997 - Computers - 534 pages
0 Reviews
Traditionally an area of study in computer science, string algorithms have, in recent years, become an increasingly important part of biology, particularly genetics. This volume is a comprehensive look at computer algorithms for string processing. In addition to pure computer science, Gusfield adds extensive discussions on biological problems that are cast as string problems and on methods developed to solve them. This text emphasizes the fundamental ideas and techniques central to today's applications. New approaches to this complex material simplify methods that up to now have been for the specialist alone. With over 400 exercises to reinforce the material and develop additional topics, the book is suitable as a text for graduate or advanced undergraduate students in computer science, computational biology, or bio-informatics.
  

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

II Suffix Trees and Their Uses
87
III Inexact Matching Sequence Alignment Dynamic Programming
209
IV Currents Cousins and Cameos
393
Epilogue where next?
501
Bibliography
505
Glossary
524
Index
530
Copyright

Common terms and phrases

About the author (1997)

Dan Gusfield is Professor of Computer Science at the University of California, Davis. He is the coauthor of "The Stable Marriage Problem: Structure and Algorithms" (MIT Press) and author of "Algorithms on Strings, Trees, and Sequences".

Bibliographic information