|
Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
Hardback
Main Details
Title |
Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology
|
Authors and Contributors |
By (author) Dan Gusfield
|
Physical Properties |
Format:Hardback | Pages:556 | Dimensions(mm): Height 262,Width 188 |
|
Category/Genre | Algorithms and data structures |
ISBN/Barcode |
9780521585194
|
Classifications | Dewey:005.1 |
---|
Audience | Professional & Vocational | |
Illustrations |
145 Line drawings, unspecified
|
|
Publishing Details |
Publisher |
Cambridge University Press
|
Imprint |
Cambridge University Press
|
Publication Date |
28 May 1997 |
Publication Country |
United Kingdom
|
Description
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.
Reviews'The readers of this book will be serious programmers, but of course anybody working in bio-computing will find the book of immense practical, scientific and commercial importance ... you should get the book, whether you want to do some string processing, fundamental computing research, or want to impress a biotech firm.' Harold Thimbleby, Times Higher Education Supplement '... could well be used as the basis for a graduate-level course, particularly as it contains over 400 exercises to reinforce presented material and to develop further topics. It is recommended most highly.' P. Gibbons, Zentralblatt fur Mathematik
|