EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items & rentals.
EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items & rentals.
EVERYDAY FREE SHIPPING on $25 & up - Excludes marketplace items & rentals
Search
Algorithms on Strings, Trees and Sequences

Algorithms on Strings, Trees and Sequences - 97 edition

ISBN13: 978-0521585194

Cover of Algorithms on Strings, Trees and Sequences 97 (ISBN 978-0521585194)
ISBN13: 978-0521585194
ISBN10: 0521585198
Cover type:
Edition/Copyright: 97
Publisher: Cambridge University Press
Published: 1997
International: No
Sell this book right now for CASH!
Sell this book
right now for
$12.50 CASH!

List price: $99.99

USED
Sold Out
FREE Shipping on $25+
  • Check back soon!
  • 30-Day Returns
  • Condition: Very Good
Sold Out
rental
$83.99
Save $16.00 (16%)


Ships from $5.99
  • Free Return Shipping
  • Due back 12/18/2015
  • CDs or access codes
    may not be included
More Shipping Options

Algorithms on Strings, Trees and Sequences - 97 edition

ISBN13: 978-0521585194

Dan Gusfield

ISBN13: 978-0521585194
ISBN10: 0521585198
Cover type:
Edition/Copyright: 97
Publisher: Cambridge University Press

Published: 1997
International: No
Summary

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.

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

List price: $99.99
  • Rental
  • $83.99
  • Marketplace
  • From
More Shipping Options