Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence

DOI10.1007/978-3-642-31265-6_12zbMath1358.68334OpenAlexW73366147MaRDI QIDQ2904488

Oren Weimann, Ferdinando Cicalese, Raphael Yuster, Eduardo Sany Laber

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_12

zbMATH Keywords

approximation algorithmsapproximate pattern matchingParikh vectorsmaximum subsequence sum

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Related Items (5)

Permuted scaled matching ⋮ Binary jumbled pattern matching on trees and tree-like structures ⋮ New algorithms for binary jumbled pattern matching ⋮ Binary jumbled string matching for highly run-length compressible texts ⋮ On prefix normal words and prefix normal forms

This page was built for publication: Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence