35 citations · 99 across the 47 of their papers we have counts for
Showing 2020Show all
2 papers · 1 filter
cs.DS2020★ 4 cited
String Indexing for Top- Close Consecutive Occurrences
Philip Bille, Inge Li Gørtz, Max Rishøj Pedersen +2
The classic string indexing problem is to preprocess a string into a compact data structure that supports efficient subsequent pattern matching queries, that is, given a patter…
cs.DS2020
Random Access in Persistent Strings and Segment Selection
Philip Bille, Inge Li Gørtz
We consider compact representations of collections of similar strings that support random access queries. The collection of strings is given by a rooted tree where edges are labele…