Substring compression problems
Published in Symposium on Discrete Algorithms • Jan 23, 2005
Authors:,
Graham Cormode
S. Muthukrishnan
Abstract
We initiate a new class of string matching problems called Substring Compression Problems. Given a string S that may be preprocessed, the problem is to quickly find the compressed representation or the compressed size of any query substring of S (Substring Compression Query or SCQ) or to find the le...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!