Compressed

• Wavelet Tree

  Succinct structure for rank/select queries on sequences; enables fast pattern searching and compressed storage with fast access.

• Suffix Tree

  Compressed trie of all suffixes enabling O(m) pattern matching without binary search; space-expensive but time-optimal.

• Roaring Bitmap

  Compressed bitmap enabling fast set operations (AND, OR); space-efficient for storing large sparse sets of integers.

• FM-Index

  Full-text index based on Burrows-Wheeler Transform; enables pattern matching and compressed storage simultaneously.