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 ...
    • Munro, J. Ian; Navarro, Gonzalo; Shah, Rahul; Thankachan, Sharma (Elsevier, 2020)
    • Munro, J. Ian; Navarro, Gonzalo; Nielsen, Jesper Sindahl; Shah, Rahul; Thankachan, Sharma V. (Springer, 2017)
      LetD={T1,T2,...,TD}be a collection ofDstring doc-uments ofncharacters in total, that are drawn from an alphabet setΣ= [σ]. Thetop-kdocument retrieval problemis to preprocessDintoa data structure that, given a ...