@InProceedings{studeny_et_al:LIPIcs.CPM.2019.15,
author = {Studen\'{y}, Jan and Uzna\'{n}ski, Przemys{\l}aw},
title = {{Approximating Approximate Pattern Matching}},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)},
pages = {15:1--15:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-103-0},
ISSN = {1868-8969},
year = {2019},
volume = {128},
editor = {Pisanti, Nadia and P. Pissis, Solon},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2019.15},
URN = {urn:nbn:de:0030-drops-104865},
doi = {10.4230/LIPIcs.CPM.2019.15},
annote = {Keywords: Approximate Pattern Matching, l\underlinep Distance, l\underline1 Distance, Hamming Distance, Approximation Algorithms}
}