Sentence examples for maximum subsequence problem from inspiring English sources

The maximum subsequence problem finds a contiguous subsequence of the largest sum of a sequence of n numbers.

We also refer to this problem as the 1D maximum subsequence sum problem.

In this paper, we revisit the maximum subsequence sum problem and propose solutions to three related problems: the longest maximum subsequence sum, the shortest maximum subsequence sum, and the number of disjoint subsequences of maximum sum.

Through the output array, we can find all disjoint subsequences of the maximum subsequence sum problem.

The best sequential algorithm for the maximum subsequence sum problem, has O(n) time complexity [2].

Previous works have reported good parallel solutions for the maximum subsequence sum problem.

In 2004, Alves et al. [1] presented a BSP/CGM algorithm for the maximum subsequence sum problem.

Next we present new BSP/CGM algorithms to solve the 1D maximum subsequence sum problem, the shortest/longest maximum subsequences, and the total number of maximum subsequences.

The solution of this problem arises in many areas of science, such as computational biology, where many applications require the solution of the maximum subsequence sum problem.

Given a sequence of n numbers, the task of finding the contiguous subsequence, with maximum sum over all subsequences of the given sequence, is called the maximum subsequence sum problem [2].

The 1D maximum subsequence sum problem is to determine, among all possible subsequences, the subsequence M=(x i,…,x j ) that has the maximum sum ((sum _{k=i}^{j}x_{k})) [2].