5 citations · 6 across the 5 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
Optimal Time Random Access to Grammar-Compressed Strings in Small Space
Patrick Hagge Cording
The random access problem for compressed strings is to build a data structure that efficiently supports accessing the character in position of a string given in compressed form…
cs.DS2014
Compressed Subsequence Matching and Packed Tree Coloring
Philip Bille, Patrick Hagge Cording, Inge Li Gørtz
We present a new algorithm for subsequence matching in grammar compressed strings. Given a grammar of size compressing a string of size and a pattern string of size ove…