journal · Information Retrieval · 2008A compressed self-index using a Ziv–Lempel dictionaryLuís M. S.Russo, Arlindo L. Oliveira · 33 citationsView original publication →See where this sits in the topic map →References within the groupA Compressed Self-index Using a Ziv-Lempel DictionaryLuís M. S.Russo, Arlindo L. OliveiraLecture notes in computer science book Cited by (group publications)Approximate String Matching with Lempel-Ziv Compressed IndexesLuís M. S.Russo, Gonzalo Navarro, Arlindo L. OliveiraLecture notes in computer science book Dynamic Fully-Compressed Suffix TreesLuís M. S.Russo, Gonzalo Navarro, Arlindo L. OliveiraLecture notes in computer science book Approximate String Matching with Compressed IndexesLuís M. S.Russo, Gonzalo Navarro, Arlindo L. Oliveira, Pedro MoralesAlgorithms journal Fully compressed suffix treesLuís M. S.Russo, Gonzalo Navarro, Arlindo L. OliveiraACM Transactions on Algorithms journal ← All publications
A Compressed Self-index Using a Ziv-Lempel DictionaryLuís M. S.Russo, Arlindo L. OliveiraLecture notes in computer science book
Approximate String Matching with Lempel-Ziv Compressed IndexesLuís M. S.Russo, Gonzalo Navarro, Arlindo L. OliveiraLecture notes in computer science book
Dynamic Fully-Compressed Suffix TreesLuís M. S.Russo, Gonzalo Navarro, Arlindo L. OliveiraLecture notes in computer science book
Approximate String Matching with Compressed IndexesLuís M. S.Russo, Gonzalo Navarro, Arlindo L. Oliveira, Pedro MoralesAlgorithms journal
Fully compressed suffix treesLuís M. S.Russo, Gonzalo Navarro, Arlindo L. OliveiraACM Transactions on Algorithms journal