Suffix tree
- Date
- 1973 · confidence high
- Place
- New Haven, Connecticut, United States
- Credited to
- Peter Weiner
- Field
- Knowledge & symbols
What it is
A data structure that compresses all suffixes of a text string into a tree, enabling substring searches and other pattern-matching operations in linear time; introduced by Peter Weiner in 1973.
What it led to
- Fast substring search and approximate pattern matching
- Bioinformatics algorithms for comparing DNA sequences
- Derived structures such as the suffix array