However, for very long texts that exceed the capacity of a conventional computer's internal memory, one needs to play algorithmic tricks—using multiple networked computers or carefully managing external storage to disk—to benefit from their use as a text representation. In this talk, I'll examine parallel algorithms for constructing suffix trees and how their exploration inspired recent novel sequential algorithms for suffix arrays.