We define a generalization of the prefix sum problem in which the vector can be masked by segments of a second (Boolean) vector. This problem is shown to be related to several other prefix sum, set intersection and approximate string match problems, via specific algorithms, reductions and conditional lower bounds. To our knowledge, we are the first to consider the fully internal measurement queries and prove lower bounds for them. We also discuss the hardness of the sparse variation in both static and dynamic settings. Finally, we provide a parallel algorithm to compute the answers to all possible queries when both vectors are fixed.
|Title of host publication||String Processing and Information Retrieval - 29th International Symposium, SPIRE 2022, Proceedings|
|Editors||Diego Arroyuelo, Diego Arroyuelo, Barbara Poblete|
|Publisher||Springer Science and Business Media Deutschland GmbH|
|Number of pages||16|
|State||Published - 2022|
|Event||29th International Symposium on String Processing and Information Retrieval, SPIRE 2022 - Concepción, Chile|
Duration: 8 Nov 2022 → 10 Nov 2022
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||29th International Symposium on String Processing and Information Retrieval, SPIRE 2022|
|Period||8/11/22 → 10/11/22|
Bibliographical notePublisher Copyright:
© 2022, The Author(s), under exclusive license to Springer Nature Switzerland AG.