Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures

@inproceedings{Golynski2007UpperAL,
  title={Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures},
  author={Alexander Golynski},
  year={2007}
}
The main goal of this thesis is to investigate the complexity of a variety of problems related to text indexing and text searching. We present new data structures that can be used as building blocks for full-text indices which occupies minute space (FM-indexes) and wavelet trees. These data structures also can be used to represent labeled trees and posting lists. Labeled trees are applied in XML documents, and posting lists in search engines. The main emphasis of this thesis is on lower bounds… CONTINUE READING