Now showing items 1-3 of 3

    • Munro, J. Ian; Navarro, Gonzalo; Nekrich, Yakov (Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017)
      We introduce a compressed suffix array representation that, on a textTof lengthnover analphabet of sizeσ, can be built inO(n)deterministic time, withinO(nlogσ)bits of workingspace, and counts the number of occurrences of ...
    • Fuentes Sepúlveda, José; Navarro, Gonzalo; Nekrich, Yakov (Elsevier, 2020)
      The Burrows-Wheeler Transform (BWT) has become since its introduction a key tool for representing large text collections in compressed space while supporting indexed searching: on a text of length n over an alphabet of ...
    • Navarro, Gonzalo; Nekrich, Yakov (Society for Industrial and Applied Mathematics, 2017)
      LetDbe a collection ofDdocuments, which are strings over an alphabet of sizeσ,of total lengthn. We describe a data structure that uses linear space and reportskmost relevantdocuments that contain a query patternP, which ...