@InProceedings{iliopoulos_et_al:LIPIcs.CPM.2016.8,
author = {Iliopoulos, Costas S. and Radoszewski, Jakub},
title = {{Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties}},
booktitle = {27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016)},
pages = {8:1--8:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-012-5},
ISSN = {1868-8969},
year = {2016},
volume = {54},
editor = {Grossi, Roberto and Lewenstein, Moshe},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CPM.2016.8},
URN = {urn:nbn:de:0030-drops-60842},
doi = {10.4230/LIPIcs.CPM.2016.8},
annote = {Keywords: string with don’t cares, partial word, indeterminate string, longest common conservative prefix queries, prefix array}
}