@InProceedings{amir_et_al:LIPIcs.CPM.2019.6,
author = {Amir, Amihood and Kondratovsky, Eitan},
title = {{Sufficient Conditions for Efficient Indexing Under Different Matchings}},
booktitle = {30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019)},
pages = {6:1--6:12},
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.6},
URN = {urn:nbn:de:0030-drops-104773},
doi = {10.4230/LIPIcs.CPM.2019.6},
annote = {Keywords: off-the-shelf indexing algorithms, general matching relations, weaker sufficient conditions for indexing}
}