@inbook{ca785c1c2b214afe8bbb2ac046abb7f6,
title = "Internal Quasiperiod Queries",
abstract = "Internal pattern matching requires one to answer queries about factors of a given string. Many results are known on answering internal period queries, asking for the periods of a given factor. In this paper we investigate (for the first time) internal queries asking for covers (also known as quasiperiods) of a given factor. We propose a data structure that answers such queries in time for the shortest cover and in time for a representation of all the covers, after time and space preprocessing.",
keywords = "Cover, Internal pattern matching, Quasiperiodicity, Run (maximal repetition), Seed",
author = "Maxime Crochemore and Iliopoulos, {Costas S.} and Jakub Radoszewski and Wojciech Rytter and Juliusz Straszy{\'n}ski and Tomasz Wale{\'n} and Wiktor Zuba",
year = "2020",
month = jan,
day = "1",
doi = "10.1007/978-3-030-59212-7_5",
language = "English",
isbn = "9783030592110",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Science and Business Media Deutschland GmbH",
pages = "60--75",
editor = "Christina Boucher and Thankachan, {Sharma V.}",
booktitle = "String Processing and Information Retrieval - 27th International Symposium, SPIRE 2020, Proceedings",
address = "Germany",
note = "27th International Symposium on String Processing and Information Retrieval, SPIRE 2020 ; Conference date: 13-10-2020 Through 15-10-2020",
}