35 citations · 99 across the 47 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
cs.DS2014
Longest Common Extensions in Trees
Philip Bille, Pawel Gawrychowski, Inge Li Goertz +2
The longest common extension (LCE) of two indices in a string is the length of the longest identical substrings starting at these two indices. The LCE problem asks to preprocess a…
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…