35 citations · 50 across the 10 of their papers we have counts for
Showing 2012 · cs.DSShow all
2 papers · 2 filters
cs.DS2012★ 7 cited
Time-Space Trade-Offs for Longest Common Extensions
Philip Bille, Inge Li Goertz, Benjamin Sach +1
We revisit the longest common extension (LCE) problem, that is, preprocess a string into a compact data structure that supports fast LCE queries. An LCE query takes a pair $(i,…
cs.DS2012
Sparse Suffix Tree Construction with Small Space
Philip Bille, Inge Li Gørtz, Tsvi Kopelowitz +2
We consider the problem of constructing a sparse suffix tree (or suffix array) for suffixes of a given text of size , using only words of space during constructio…