Book

Algorithms on Strings, Trees, and Sequences

by Dan Gusfield

📖 Overview

Algorithms on Strings, Trees, and Sequences by Dan Gusfield is a computer science textbook focused on computational molecular biology and string algorithms. The book presents algorithms and data structures that process genetic sequences and other string data types. The content progresses from basic string matching through advanced topics like suffix trees and sequence alignment methods. Technical concepts are explained with concrete examples and applications to DNA/RNA analysis, making abstract ideas accessible to readers with biology or computer science backgrounds. The book includes detailed pseudocode, complexity analysis, and proofs for key algorithms. Problems and exercises allow readers to test their understanding, while extensive citations connect the material to research literature. This work bridges theoretical computer science with practical bioinformatics applications, establishing foundations that remain relevant to modern genomic research and string processing. The clear presentation style has made it a standard reference in computational biology education and research.

👀 Reviews

Readers consistently note this book works better as a reference text than a self-study guide. Computer scientists and bioinformatics researchers value its comprehensive coverage of string algorithms and their biological applications. Liked: - Deep mathematical treatment of algorithms - Clear explanations of suffix trees and arrays - Detailed proofs and theoretical foundations - Strong focus on computational biology applications Disliked: - Dense writing style requires significant background knowledge - Few worked examples and exercises - Some code implementations missing or outdated - High price point ($90-120) A PhD student on Goodreads notes "assumes familiarity with algorithmic concepts that aren't explained." Multiple Amazon reviewers mention the book is "not for beginners" and "requires careful study." Ratings: Goodreads: 4.16/5 (43 ratings) Amazon: 4.3/5 (24 ratings) Several readers recommend pairing it with more practical texts like Algorithms on Strings by Crochemore for implementation details.

📚 Similar books

Introduction to the Theory of Computation by Michael Sipser This text covers formal languages, automata theory, and computational complexity, providing foundations that complement string algorithms and pattern matching concepts.

String Processing and Information Retrieval by Maxime Crochemore and Wojciech Rytter The book presents string matching algorithms, text compression methods, and information retrieval techniques with mathematical rigor and practical applications.

Pattern Matching Algorithms by Alberto Apostolico, Zvi Galil The text covers advanced string matching algorithms, suffix trees, and pattern analysis with detailed mathematical proofs and implementation considerations.

Introduction to Computational Biology by Michael Waterman This work connects string algorithms to biological sequence analysis, genome mapping, and DNA pattern matching applications.

Handbook of Exact String Matching Algorithms by Christian Charras and Thierry Lecroq The book catalogs string matching algorithms with pseudocode implementations and complexity analysis for practical applications.

🤔 Interesting facts

🔹 Published in 1997, this book became one of the first comprehensive texts to bridge computer science algorithms with computational biology, helping establish bioinformatics as an academic discipline. 🔹 Dan Gusfield developed much of the material while teaching at UC Davis, where he served as the founding chair of the Computer Science Department and pioneered courses in computational biology. 🔹 The string matching algorithms covered in this book are fundamental to modern DNA sequencing technologies and have played a crucial role in the Human Genome Project. 🔹 The book's suffix tree algorithms are still widely used today in text editors, web searches, and DNA pattern matching, making it relevant more than 25 years after publication. 🔹 The problems and solutions presented in this work have influenced modern applications beyond biology, including plagiarism detection software and data compression techniques.