Algorithms on Strings, Trees, and Sequences (Hardcover)

Dan Gusfield

ISBN 10: 0521585198 / ISBN 13: 9780521585194

Edité par Cambridge University Press, Cambridge, 1997

A propos de cet article

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.

N° de réf. du vendeur 9780521585194

Détails bibliographiques

• Titre: Algorithms on Strings, Trees, and Sequences (Hardcover)
• Éditeur: Cambridge University Press, Cambridge
• Date de parution: 1997
• Langue: anglais
• ISBN à 10 chiffres: 0521585198
• ISBN à 13 chiffres: 9780521585194
• Reliure: Hardcover
• Édition: Edition originale
• État de l'article: new

A propos de ce titre

Synopsis

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.

Présentation de l'éditeur

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 1997 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.