|
|
|
|
|
|
|
HELP | |
|
 $81.90 List price:
HARDCOVER, NEW
Ships in 1 to 3 days
 available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
More copies of this ISBN:Algorithms on Strings, Trees and Sequences (97 Edition)by Dan Gusfield
Synopses & ReviewsPublisher Comments: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. Review:"...an important summary of the state of the art in pattern matching and an indicator of the importance biological problems have assumed among many researchers. It will hopefully encourage them to question the importance of the problems they endeavor to solve." SIGACT News"The book will be profitable both for graduate students in computer science and for biologists with a good background in programming." Mathematical Reviews"One often encounters in this book thought-provoking quotes relating to the importance of sequence analysis...Also found in the text are interesting biological examples of sequence analysis..." Cell 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 produced by various genome projects. This book explains a wide range of computer methods for string processing. It also contains extensive discussions on biological problems that are cast as string problems, and on techniques to solve them. The book is both a reference for computer scientists and computer-oriented professionals in biology and bio-informatics and a textbook for graduate and advanced undergraduate courses on string algorithms and on computational biology. Synopsis:Describes a range of string problems in computer science and molecular biology and the algorithms developed to solve them. Description:Includes bibliographical references (p. 505-523) and index. Table of ContentsPart 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.
What Our Readers Are SayingBe the first to add a comment for a chance to win!Product Details
Other books you might like
Related Aisles
| ||||||||||||
|
| |||||||||||||
|
|||||||||||||
Don't Miss
