+612 9045 4394
 
CHECKOUT
Algorithms on Strings, Trees, and Sequences : Computer Science and Computational Biology - Dan Gusfield

Algorithms on Strings, Trees, and Sequences

Computer Science and Computational Biology

Hardcover

Published: 28th May 1997
Ships: 7 to 10 business days
7 to 10 business days
$169.25
or 4 easy payments of $42.31 with Learn more

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.

'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

Exact String Matching: The Fundamental String Problem
Exact matching: fundamental preprocessing and first algorithms
Exact matching: classical comparison-based methods
Exact matching: a deeper look at classical methods
Semi-numerical string matching
Suffix Trees And Their Uses
Introduction to suffix trees
Linear time construction of suffix trees
First applications of suffix trees
Constant time lowest common ancestor retrieval
More applications of suffix trees
Inexact Matching, Sequence Alignment, And Dynamic Programming
The importance of (sub)sequence comparison in molecular biology
Core string edits, alignments, and dynamic programming
Refining core string edits and alignments
Extending the core problems
Multiple string comparison: the Holy Grail
Sequence database and their uses: the motherlode
Currents, Cousins And Cameos
Maps, mapping, sequencing and superstrings
Strings and evolutionary trees
Three short topics
Models of genome-level mutations
Table of Contents provided by Publisher. All Rights Reserved.

ISBN: 9780521585194
ISBN-10: 0521585198
Audience: Professional
Format: Hardcover
Language: English
Number Of Pages: 556
Published: 28th May 1997
Publisher: Cambridge University Press
Country of Publication: GB
Dimensions (cm): 25.3 x 17.7  x 3.7
Weight (kg): 1.09