English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  DetailsSummary

Released
Conference Paper

Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts

MPS-Authors
/persons/resource/persons44182

Bringmann,  Karl
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons44857

Künnemann,  Marvin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons229250

Wellnitz,  Philip
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Bringmann, K., Künnemann, M., & Wellnitz, P. (2019). Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1126-1145). Philadelphia, PA: SIAM. doi:10.1137/1.9781611975482.69.


Cite as: https://hdl.handle.net/21.11116/0000-0002-9E1F-B
Abstract
There is no abstract available