Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
type: Item
instance of: scholarly article
title: Near Linear Time Construction of an Approximate Index for All Maximum Consecutive Sub-sums of a Sequence
zbMATH Open document ID: 1358.68334
DOI: 10.1007/978-3-642-31265-6_12
author: Ferdinando Cicalese
author: Oren Weimann
author: Raphael Yuster
author: Eduardo S. Laber
published in: Combinatorial Pattern Matching
publication date: 2012-08-14T00:00:00Z
Mathematics Subject Classification ID: 68W32
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 6065599
zbMATH Keywords: Parikh vectors
zbMATH Keywords: maximum subsequence sum
zbMATH Keywords: approximate pattern matching
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: 978-3-642-31265-6 12
OpenAlex ID: W73366147
Recommended article: Approximating the maximum consecutive subsums of a sequence
Recommended article: Linear time computation of the maximal linear and circular sums of multiple independent insertions into a sequence
Recommended article: A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum
Recommended article: An Approximation Scheme for the Problem of Finding a Subsequence
Recommended article: Near-optimal algorithm to count occurrences of subsequences of a given length
Recommended article: Exact algorithms for two integer-valued problems of searching for the largest subset and longest subsequence
Recommended article: An Almost Linear-Time Algorithm for the Dense Subset-Sum Problem
Recommended article: Q4036607
Recommended article: Efficient Computation of the Maximum of the Sum of Two Sequences and Applications
Recommended article: Algorithms and Computation
description: scientific article