Skip to main content

2 Result(s)

within Uwe Baier Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Trickier XBWT Tricks

    A trie [11] is one of the best data structures for implementing and searching a dictionary. However, to build the trie structure for larger collections of strings takes up a lot of memory. Since the eXtended Burr...

    Enno Ohlebusch, Stefan Stauß, Uwe Baier in String Processing and Information Retrieval (2018)

  2. No Access

    Chapter and Conference Paper

    Parallel Construction of Succinct Representations of Suffix Tree Topologies

    A compressed suffix tree usually consists of three components: a compressed suffix array, a compressed \(\mathsf {LCP}\) -array,...

    Uwe Baier, Timo Beller, Enno Ohlebusch in String Processing and Information Retrieval (2015)