1 citations · 2 across the 4 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2013★ 1 cited
Order Preserving Matching
Jinil Kim, Peter Eades, Rudolf Fleischer +5
We introduce a new string matching problem called order-preserving matching on numeric strings where a pattern matches a text if the text contains a substring whose relative orders…
cs.DS2011★ 1 cited
Fixed Block Compression Boosting in FM-Indexes
Juha Kärkkäinen, Simon J. Puglisi
A compressed full-text self-index occupies space close to that of the compressed text and simultaneously allows fast pattern matching and random access to the underlying text. Amon…
cs.DS2010
New Algorithms on Wavelet Trees and Applications to Information Retrieval
Travis Gagie, Gonzalo Navarro, Simon J. Puglisi
Wavelet trees are widely used in the representation of sequences, permutations, text collections, binary relations, discrete points, and other succinct data structures. We show, ho…