Pith. sign in

Title resolution pending

· 2013

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2019 1

verdicts

CONDITIONAL 1

representative citing papers

Space-Efficient Construction of Compressed Suffix Trees

cs.DS · 2019-08-12 · conditional · novelty 7.0

A set of algorithms that build LCP, PLCP, and suffix tree topology from a BWT in O(n log σ) time using o(n log σ) extra bits, plus an o(n log σ)-space BWT merging algorithm.

citing papers explorer

Showing 1 of 1 citing paper.

  • Space-Efficient Construction of Compressed Suffix Trees cs.DS · 2019-08-12 · conditional · none · ref 6

    A set of algorithms that build LCP, PLCP, and suffix tree topology from a BWT in O(n log σ) time using o(n log σ) extra bits, plus an o(n log σ)-space BWT merging algorithm.