Enjoy fast, free delivery, exclusive deals, and award-winning movies & TV shows with Prime
Try Prime
and start saving today with fast, free delivery
Amazon Prime includes:
Fast, FREE Delivery is available to Prime members. To join, select "Try Amazon Prime and start saving today with Fast, FREE Delivery" below the Add to Cart button.
Amazon Prime members enjoy:- Cardmembers earn 5% Back at Amazon.com with a Prime Credit Card.
- Unlimited Free Two-Day Delivery
- Streaming of thousands of movies and TV shows with limited ads on Prime Video.
- A Kindle book to borrow for free each month - with no due dates
- Listen to over 2 million songs and hundreds of playlists
- Unlimited photo storage with anywhere access
Important: Your credit card will NOT be charged when you start your free trial or if you cancel during the trial period. If you're happy with Amazon Prime, do nothing. At the end of the free trial, your membership will automatically upgrade to a monthly membership.
Buy new:
$88.22$88.22
FREE delivery:
Tuesday, Feb 13
Ships from: Amazon.com Sold by: Amazon.com
Buy used: $29.38
Other Sellers on Amazon
& FREE Shipping
91% positive over last 12 months
91% positive over last 12 months
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology 1st Edition
Purchase options and add-ons
Review
"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
Book Description
- ISBN-100521585198
- ISBN-13978-0521585194
- Edition1st
- PublisherCambridge University Press
- Publication dateMay 28, 1997
- LanguageEnglish
- Dimensions7.25 x 1.5 x 10.75 inches
- Print length556 pages
Frequently bought together

Customers who viewed this item also viewed
Product details
- Publisher : Cambridge University Press; 1st edition (May 28, 1997)
- Language : English
- Hardcover : 556 pages
- ISBN-10 : 0521585198
- ISBN-13 : 978-0521585194
- Item Weight : 2.63 pounds
- Dimensions : 7.25 x 1.5 x 10.75 inches
- Best Sellers Rank: #660,069 in Books (See Top 100 in Books)
- #100 in Discrete Mathematics (Books)
- #775 in Microsoft Programming (Books)
- #3,754 in Core
- Customer Reviews:
Important information
To report an issue with this product or seller, click here.
About the author

Discover more of the author’s books, see similar authors, read author blogs and more
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on AmazonReviews with images
-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
All of the major exact string algorithms are covered, including Knuth-Morris-Pratt, Boyer-Moore, Aho-Corasick and the focus of the book, suffix trees for the much harder probem of finding all repeated substrings of a given string in linear time. In addition to exact string matching, there are extensive discussions of inexact matching. Even the discussions of widely known topics like dynamic programming for edit distance are insightful; for instance, we find how to easily cut space requirements from quadratic to linear. There is also a short chapter on semi-numerical matching methods, which are also of use in information retrieval applications. Inexact matching is extended to the threshold all-against-all problem, which finds all substrings of a string that match up to a given edit distance threshold. The theoretical development concludes with the much more difficult problem of aligning multiple sequences with ultrametric trees, with applications to phylogenetic alignment for evolutionary trees (an approach that has also been applied to the evolution of natural languages).
Note that there is no discussion of statistical string matching. For that, Durbin, Eddy, Krogh and Mitchison's "Biological Sequence Analysis: Probabilistic Models of Proteins and Nucleic Acides" is a good choice, or for those more interested in language than biology, Manning and Schuetze's "Statistical Natural Language Processing". There is also no information on more structured string matching models such as context-free grammars, as are commonly used to analyze RNA folding or natural language syntax. Luckily, Durbin et al. and Manning and Schuetze also provide excellent coverage of these higher-order models in their books.
This book is not about efficient implementation. If you need to build these algorithms, you'll also need to know how to write efficient code and tune it for your needs. This is an algorithms book, pure and simple.
As a computer scientist, I found the discussions of computational biology to be more enlightening than in other textbooks on similar topics such as Durbin et al., because Gusfield does not assume the reader has any background in cellular biology. Instead, he provides his own clear and gentle introductions illustrated with algorithms, applications, open problems and extensive references. Like most Cambridge University Press books, this one is beautifully typeset and edited.
Although it says algorithms on strings, trees and sequences, the only tree algorithms are the ones that has to do with string, which is the main theme for the book. Meaning, there isn't anything about trees that don't have to do with strings, like binary search trees for example.
Even if you don't do computational biology, if you're learning string algorithms, then I definitely recommend this book.
Reviewed in the United States on November 13, 2021
Top reviews from other countries
Hopefully, a second edition will cover recent advances in string algorithms, particularly suffix arrays.
ヒトゲノム計画によりゲノムシーケンスがほぼ解明されてきており、この大量の文字列を解析するのに様々な文字列マッチングが有用である。
とりわけ本書で詳説されるSuffix Treeは、部分文字列を非常に効率よく同定できるため、応用も多い。
これはゲノムだけでなくウェブ上や辞書のテキストも文字列であるため、検索語を非常に効率よく検索できることを意味する。
とりわけ、ゲノム情報での使い方がくわしいため、バイオインフォマティクスをやっている方、やろうと思われる方は、読んでおくことをお奨めします。







