112 citations · 369 across the 25 of their papers we have counts for
Showing 2011 · cs.DSShow all
2 papers · 2 filters
cs.DS2011
On-line construction of position heaps
Gregory Kucherov
We propose a simple linear-time on-line algorithm for constructing a position heap for a string [Ehrenfeucht et al, 2011]. Our definition of position heap differs slightly from the…
cs.DS2011★ 9 cited
Linear pattern matching on sparse suffix trees
Roman Kolpakov, Gregory Kucherov, Tatiana Starikovskaya
Packing several characters into one computer word is a simple and natural way to compress the representation of a string and to speed up its processing. Exploiting this idea, we pr…