Algorithms on Strings, Trees, and Sequences (Hardcover)

Dan Gusfield

ISBN 10: 0521585198 / ISBN 13: 9780521585194

Editore: Cambridge University Press, Cambridge, 1997

Riguardo questo articolo

Hardcover. 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. Describes a range of string problems in computer science and molecular biology and the algorithms developed to solve them. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

Codice articolo 9780521585194

Dati bibliografici

• Titolo: Algorithms on Strings, Trees, and Sequences (Hardcover)
• Editore: Cambridge University Press, Cambridge
• Data di pubblicazione: 1997
• Lingua: Inglese
• ISBN 10: 0521585198
• ISBN 13: 9780521585194
• Rilegatura: Hardcover
• Edizione: prima edizione
• Condizione: new

Descrizione articolo

Riassunto

This book describes a range of string problems in computer science and molecular biology and the algorithms developed to solve them.

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