• Corpus ID: 2681670

# Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem

@inproceedings{Bae2007SequentialAP,
title={Sequential and Parallel Algorithms for the Generalized Maximum Subarray Problem},
author={Sung Eun Bae},
year={2007}
}
The maximum subarray problem (MSP) involves selection of a segment of consecutive array elements that has the largest possible sum over all other segments in a given array. The efficient algorithms for the MSP and related problems are expected to contribute to various applications in genomic sequence analysis, data mining or in computer vision etc. The MSP is a conceptually simple problem, and several linear time optimal algorithms for 1D version of the problem are already known. For 2D version…
Efficient BSP/CGM Algorithms for the Maximum Subarray Sum and Related Problems
• Computer Science
ICCSA
• 2015
This work revisits the BSP/CGM parallel algorithm that solves the maximum subarray sum problem and presents BSP-CGM algorithms for the following related problems: the maximum largest subarraySum, the maximum smallest subarray Sum, the number of subarrays of maximum sum, the selection of the subarray with k- maximum sum and the location of theSubarray with the maximum relative density sum.
Parallel version of the Generalized Multidimensional K-Maximum Subarray Problem with CUDA-based Implementation
This work involves analyzing a sequential lower bounded, O(N+K) algorithm for K-MSP in 1-D and then developing a CUDA-based implementation which is competitive with the sequential version.
Efficient Algorithms for the Maximum Sum Problems
• Computer Science, Mathematics
Algorithms
• 2017
This work presents efficient sequential and parallel algorithms for the maximum sum (MS) problem, which is to maximize the sum of some shape in the data array, and achieves the asymptotic time bound of O ( n ) on an ( n , n ) 2D array of processors.
High performance CUDA-based implementation for the 2D version of the Maximum Subarray Problem (MSP)
• Computer Science
2012 Cairo International Biomedical Engineering Conference (CIBEC)
• 2012
A stage by stage high performance Graphics Processing Unit (GPU)-based implementation for solving the 2D version of the problem in a linear time relying on the Compute Unified Device Architecture (CUDA) technology is presented.
An efficient parallel algorithm for the maximum convex sum problem
• Computer Science
ACSW
• 2016
This paper presents a parallel algorithm for the maximum convex sum (MCS) problem, which is a generalization of the maximum subarray (MSA) problem and achieves the same time bound of O(n) on an (n, n) 2D array of processors.
Efficient Algorithms for the Maximum Convex Sum Problem
The work of this research covers the Maximum Subarray Problem from a new perspective by presenting an efficient algorithm, which determines the boundaries of the convex shape while having the same time complexity as that for other existing algorithms.
MAXIMUM SUBARRAY PROBLEM OPTIMIZATION FOR SPECIFIC DATA
This paper describes a method of Kadanes algorithm (the state of the art) optimization for specific data (continuous sequences of zeros or negative real numbers) when the data are unfavourable and the modification of the algorithm causes a non significant performance loss.
Efficient parallel algorithms for the maximum subarray problem
This work gives a formal proof for the parallel algorithm on the mesh architecture based on Hoare logic to establish several space/time invariants with three indices (i; j; k) and shows those two problems of design and verification.
Parallel Algorithms for the Maximum Subarray Problem
This work gives a formal proof for the parallel algorithm on the mesh architecture based on Hoare logic to establish several space/time invariants with three indices (i;j;k) and shows those two problems of design and verication.
Maximum subarray algorithms for use in astronomical imaging
• Computer Science, Physics
J. Electronic Imaging
• 2013
Implementation of the maximum subarray algorithm on a graphics processor unit is discussed in this article for rectangular solutions and convex extensions are explored.

## References

SHOWING 1-10 OF 100 REFERENCES
Algorithms for the problem of K maximum sums and a VLSI algorithm for the K maximum subarrays problem
• Computer Science, Mathematics
7th International Symposium on Parallel Architectures, Algorithms and Networks, 2004. Proceedings.
• 2004
A VLSI K maximum subarrays algorithm with O(K * n) steps and a circuit size of O(n/sup 2/), which is cost-optimal in parallelisation of the sequential algorithm.
Improved Algorithms for the K-Maximum Subarray Problem
• Mathematics
Comput. J.
• 2006
This work finds K maximum subarrays in sorted order with improved complexity of O ((n + K) log K).
Parallel Algorithms for Maximum Subsequence and Maximum Subarray
• Mathematics
Parallel Process. Lett.
• 1995
Two O(log n)-time parallel algorithms are presented — one for finding the maximum subsequence sum of a given sequence, and the other forFinding the maximum subarray sum ofa given array.
Algorithms for k-Disjoint Maximum Subarrays
• Computer Science, Mathematics
Int. J. Found. Comput. Sci.
• 2007
The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it that is asymptotically equivalent to Ruzzo and Tompa's when sorted order is needed and O(n3 + Kn2log n) time for two-dimensions is achieved.
Improved Algorithms for the K-Maximum Subarray Problem for Small K
• Mathematics
COCOON
• 2005
The K-maximum subarray problem is to find the K subarrays with largest sums, and the time complexity is improved from O(min K+n\log^2 n, n\sqrt{K}\}) to O(nlog K + K2) for K ≤ n.
Algorithm for K Disjoint Maximum Subarrays
• Computer Science, Mathematics
International Conference on Computational Science
• 2006
The maximum subarray problem is to find the array portion that maximizes the sum of array elements in it that is cubic time when K≤ n/log n and an O(n+Klog K) time solution for one-dimension is proposed.
Fast Parallel Algorithms for the Maximum Sum Problem
• Z. Wen
• Computer Science, Mathematics
Parallel Comput.
• 1995
Algorithms for the maximum subarray problem based on matrix multiplication
• Computer Science
SODA '98
• 1998
The first subcubic algorithm is given, by reducing the problem to “funny matrix multiplication”, where the scalar product and addition in usual matrix multiplication are replaced by addition and max operations, respectively.
Parallel Maximum Sum Algorithms on Interconnection Networks
• Computer Science
• 1999
This work develops parallel algorithms for both one-dimensional and two-dimensional versions of the maximum sum problem (or max sum for short) on several interconnection networks based on a simple scheme that uses pre x sums.