String Matching

Suffix Trees in Computational Biology

A course page on suffix trees in computational biology from the University of Saskatchewan. Suffix trees are the data structure behind fast substring search in genomic sequences — O(n) construction, O(m) query — making genome-scale string matching tractable.