Threshold Approximate Matching in Grammar-Compressed Strings

@inproceedings{Tiskin2014ThresholdAM,
  title={Threshold Approximate Matching in Grammar-Compressed Strings},
  author={Alexander Tiskin},
  booktitle={Stringology},
  year={2014}
}
A grammar-compressed (GC) string is a string generated by a context-free grammar. This compression model captures many practical applications, and includes LZ78 and LZW compression as a special case. We give an efficient algorithm for threshold approximate matching on a GC-text against a plain pattern. Our algorithm improves on existing algorithms whenever the pattern is sufficiently long. The algorithm employs the technique of fast unit-Monge matrix distance multiplication, as well as a new… CONTINUE READING

From This Paper

Topics from this paper.

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Lohrey : Algorithmics on SLP - compressed strings : a survey

  • H. Bunke, T. A. Nartker
  • Groups Complexity Cryptology
  • 2012

and O

  • D. Hermelin, G. M. Landau, S. Landau
  • Weimann: A unified algorithm for accelerating…
  • 2009

Similar Papers

Loading similar papers…