Algorithms on strings, trees, and sequences computer science and computational biology

Analysis

Why This Paper Matters

This textbook by Dan Gusfield is a cornerstone in the field of string algorithms and computational biology. Published in 1997, it systematically organizes a vast body of knowledge on exact and inexact string matching, suffix trees, and sequence alignment, which are fundamental to DNA and protein sequence analysis. Its enduring citation count (3545) reflects its role as a definitive reference for both students and researchers.

The book bridges computer science and molecular biology, making algorithmic concepts accessible to biologists and biological problems relevant to computer scientists. It covers core techniques like dynamic programming for sequence alignment and suffix tree construction, which remain essential in modern bioinformatics pipelines. For AI practitioners, understanding these algorithms is crucial for tasks such as genome assembly, variant calling, and phylogenetic analysis.

Technical Contributions

• Exact String Matching: Presents classical algorithms (e.g., Knuth-Morris-Pratt, Boyer-Moore) and semi-numerical methods, with detailed preprocessing and complexity analysis.
• Suffix Trees: Introduces linear-time construction (Ukkonen's algorithm) and applications like longest common substring, substring matching, and constant-time LCA queries.
• Inexact Matching and Alignment: Covers edit distance, global/local alignment, and dynamic programming for multiple sequence comparison, framing these as core string edit problems.
• Genome-Level Models: Discusses genome mapping, sequencing, superstrings, and evolutionary trees, linking string algorithms to real biological problems.

Results

As a textbook, the paper does not present new experimental results. Instead, it provides rigorous proofs of correctness and time/space complexity for each algorithm. For example, suffix tree construction is shown to run in O(n) time, and dynamic programming for pairwise alignment is O(nm). The book's impact is measured by its citation count (3545) and its widespread use in courses and research.

Significance

This work has had a profound impact on computational biology and string algorithm research. It codified many techniques that are now standard in bioinformatics software (e.g., BLAST, genome assemblers). For AI, the algorithms underpin sequence-based machine learning methods, such as those using k-mer features or alignment kernels. The book remains relevant for practitioners needing efficient string processing in genomics, text mining, and data compression.