Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
We present a novel approach for computing all maximum consecutive subsums in a sequence of positive integers in near linear time. Solutions for this problem over binary sequences can be used for reporting existence (and possibly one occurrence) of Parikh vectors in a bit string. Recently, several attempts have been tried to build indexes for all Parikh vectors of a binary string in subquadratic time. However, to the best of our knowledge, no algorithm is know to date which can beat by more than a polylogarithmic factor the natural Θ(n 2) exhaustive procedure. Our result implies an approximate construction of an index for all Parikh vectors of a binary string in O(n 1 + η ) time, for any constant η > 0. Such index is approximate, in the sense that it leaves a small chance for false positives, i.e., Parikh vectors might be reported which are not actually present in the string. No false negative is possible. However, we can tune the parameters of the algorithm so that we can strictly control such a chance of error while still guaranteeing strong sub-quadratic running time.
KeywordsParikh vectors maximum subsequence sum approximate pattern matching approximation algorithms
Unable to display preview. Download preview PDF.
- 13.Cicalese, F., Fici, G., Lipták, Z.: Searching for jumbled patterns in strings. In: Proc. of the Prague Stringology Conference 2009 (PSC 2009), pp. 105–117 (2009)Google Scholar