Compressed suffix trees: design, construction, and applications [Elektronische Ressource] / Simon Gog

Universität Ulm |89069Ulm|Germany Fakultät fürIngenieurwissenschaftenund InformatikInstitut für TheoretischeInformatikCompressed Suffix Trees: Design,Construction, and ApplicationsDISSERTATIONzur Erlangung des Doktorgrades Dr. rer. nat.der Fakultät für Ingenieurwissenschaftenund Informatik derUniversität Ulmvorgelegt vonSIMON GOGaus EhingenAugust 2011Amtierender Dekan: Prof. Dr. Klaus DietmayerGutachter: Prof. Dr. Enno OhlebuschProf. Dr. Jacobo ToránProf. Dr. Kunihiko SadakaneTag der Promotion: 24. 11. 20113AcknowledgmentFirst of all I am grateful to my supervisor Enno Ohlebusch for the guidance during myresearch on this work here in Ulm. I also thank Uwe Schöning for providing me a researchassistant position. I would also like to thank Kunihiko Sadakane and Jacobo Torán forrefereeing my thesis.I had a great time here in Ulm during my Ph.D. studies with my colleagues of theInstitute. I enjoyed the daily discussions at lunch and the walk back around the buildingto the office. I am grateful to Adrian Kügel and Stefan Arnold for many discussions aboutAalgorithms, C++ template programming and LT X. I also thank Adrian for proofreadingEthis thesis and Markus Maucher for the suggestion to use the R programming languagefor evaluating my experimental results. I am also grateful to Timo Beller, who conductedthe experiments which are depicted in Table 5.1, and to Rodrigo Cánovas for providingme a patched version of the libcds library.