Gonzalo Navarro and Veli Mäkinen: Compressed Full-Text Indexes
http://dl.acm.org/authorize.cfm?key=979380

Kapitel 1 - 6
Kapitel 8.1
Kaptiel 9.1, 9.2
Kapitel 10.4

Enno Ohlebusch: Bioinformatics Algorithms
http://www.uni-ulm.de/in/theo/m/ohlebusch/book-bioinformatics-algorithms.html

Kapitel 4.1.1 (Suffix Array Konstruktion)
Kapitel 4.2.1 (LCP Array Konstruktion)
Kapitel 4.2.2-4.3.2 (LCP Interval Tree)
Kapitel 5.2 (LZ77 Konstruktion)
Kapitel 5.4.2

Chien, Hon, Shah, Vitter: Geometric Burrows-Wheeler Transform:
Linking Range Searching and Text Indexing
http://kuscholarworks.ku.edu/bitstream/handle/1808/7231/CHS08.geometricbw.pdf?sequence=1&isAllowed=y

(On-the-fly decoding of H_0 compressed bitvector)
Abschnitt 3 aus
http://www.dcc.uchile.cl/~gnavarro/ps/sea12.1.pdf

Trie, 
Blind Tries,
Inverted Indexes,
(Compressed) Suffix Arrays, 
Succinct Tree Representation,
Range Minimum Queries (different time-space trade-offs),
Balanced Parentheses (find_close, enclose,...)      
(Compressed) Suffix Trees, 
LCP-Interval Tree,
Backward Search (BWT, rank),
Forward Search (Psi, select),
Wavelet Trees,
Self-Delimiting Codes,
Elias-Fano Codes,
(Compressed) Suffix Trees
GREEDY Framework for Top-k Document Retrieval,
Document Frequency Structure,
String-B Tree,
Geometric Burrows Wheeler Transform
Konstruktion: Suffix Array, LCP Array, LZ77, Super-Cartesian Trees