pdf-format: |
|
@InProceedings{iliopoulos_et_al:LIPIcs:2016:6084, author = {Costas S. Iliopoulos and Jakub Radoszewski}, 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 = {Roberto Grossi and Moshe Lewenstein}, publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6084}, 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} }
Keywords: | string with don’t cares, partial word, indeterminate string, longest common conservative prefix queries, prefix array | |
Seminar: | 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016) | |
Issue date: | 2016 | |
Date of publication: | 27.06.2016 |