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

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

2.0 1
by Dan Gusfield
     
 

ISBN-10: 0521585198

ISBN-13: 9780521585194

Pub. Date: 05/28/1997

Publisher: Cambridge University Press

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…  See more details below

Overview

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.

Product Details

ISBN-13:
9780521585194
Publisher:
Cambridge University Press
Publication date:
05/28/1997
Edition description:
New Edition
Pages:
534
Sales rank:
1,225,733
Product dimensions:
6.97(w) x 9.96(h) x 1.18(d)

Table of Contents

Part I. Exact String Matching: The Fundamental String Problem: 1. Exact matching: fundamental preprocessing and first algorithms; 2. Exact matching: classical comparison-based methods; 3. Exact matching: a deeper look at classical methods; 4. Semi-numerical string matching; Part II. Suffix Trees and their Uses: 5. Introduction to suffix trees; 6. Linear time construction of suffix trees; 7. First applications of suffix trees; 8. Constant time lowest common ancestor retrieval; 9. More applications of suffix trees; Part III. Inexact Matching, Sequence Alignment and Dynamic Programming: 10. The importance of (sub)sequence comparison in molecular biology; 11. Core string edits, alignments and dynamic programming; 12. Refining core string edits and alignments; 13. Extending the core problems; 14. Multiple string comparison: the Holy Grail; 15. Sequence database and their uses: the motherlode; Part IV. Currents, Cousins and Cameos: 16. Maps, mapping, sequencing and superstrings; 17. Strings and evolutionary trees; 18. Three short topics; 19. Models of genome-level mutations.

Read More

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >

Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology 2 out of 5 based on 0 ratings. 1 reviews.
Anonymous More than 1 year ago
The book itself has great content, but the e-book seems to have a ton of errors.