- Borůvka's algorithm
- Kruskal's algorithm
- Prim's algorithm
- Boyer-Moore algorithm
- Knuth-Morris-Pratt algorithm on tries
- Ko-Aluru algorithm for constructing suffix arrays (space consumption is reduced to 2n words + n bits)
- Ukkonen's algorithm for constructing generalized suffix trees