65 citations · 333 across the 44 of their papers we have counts for
Showing 2015 · cs.DSShow all
2 papers · 2 filters
cs.DS2015★ 12 cited
Relative Suffix Trees
Andrea Farruggia, Travis Gagie, Gonzalo Navarro +2
Suffix trees are one of the most versatile data structures in stringology, with many applications in bioinformatics. Their main drawback is their size, which can be tens of times l…
cs.DS2015
Range Predecessor and Lempel-Ziv Parsing
Djamal Belazzougui, Simon J. Puglisi
The Lempel-Ziv parsing of a string (LZ77 for short) is one of the most important and widely-used algorithmic tools in data compression and string processing. We show that the Lempe…