Efficient Algorithms for Shortest Partial Seeds in Words

Abstract

problems Problem Input: pairs (φi ,Ri), where φi(x) = aix + bi + min(ci ,B[x ]) is a function and Ri = (`i , ri ] ⊆ [1, n] is a non-empty range Output: (a) argmax{φi(x) : x ∈ Ri} for each pair, (b) min{x ∈ Ri : φi(x) ≥ α} for each pair. Lemma Values (a) and (b) can be computed (offline) in linear time. Workaround for ∑ ai = O(n): use (a) queries to restrict… (More)
DOI: 10.1007/978-3-319-07566-2_20
View Slides

Topics

Cite this paper

@inproceedings{Kociumaka2014EfficientAF, title={Efficient Algorithms for Shortest Partial Seeds in Words}, author={Tomasz Kociumaka and Solon P. Pissis and Jakub Radoszewski and Wojciech Rytter and Tomasz Walen}, booktitle={CPM}, year={2014} }