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

Gusfield, Dan

ISBN 10: 0521585198 / ISBN 13: 9780521585194

Editore: Cambridge University Press, 1997

Riguardo questo articolo

Like New. Codice articolo ERICA78705215851986

Dati bibliografici

Titolo: Algorithms on Strings, Trees, and Sequences:...

Casa editrice: Cambridge University Press

Data di pubblicazione: 1997

Legatura: Hardcover

Condizione: Like New

Tipologia articolo: book

Descrizione articolo

Riassunto:

String algorithms are a traditional area of study in computer science. In recent years their importance has grown dramatically with the huge increase of electronically stored text and of molecular sequence data (DNA or protein sequences) produced by various genome projects. This book is a general text on computer algorithms for string processing. In addition to pure computer science, the book contains extensive discussions on biological problems that are cast as string problems, and on methods developed to solve them. It emphasises 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. Its discussion of current algorithms and techniques also makes it a reference for professionals.

Recensione:

'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, The 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 für Mathematik