A parallel algorithm for finding all successive minimal maximum subsequences

Authors:
Ho-Kwok Dai;Hung-Chi Su
Affiliations:
Computer Science Department, Oklahoma State University, Stillwater, Oklahoma;Department of Computer Science, Arkansas State University, Arkansas
Venue:
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Year:
2006

Citing 6
Cited 3

Highly parallelizable problems

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An introduction to parallel algorithms

An introduction to parallel algorithms
Efficient Geometric Algorithms on the EREW PRAM

IEEE Transactions on Parallel and Distributed Systems
Algorithms on strings, trees, and sequences: computer science and computational biology

Algorithms on strings, trees, and sequences: computer science and computational biology
Parallel Prefix Computation

Journal of the ACM (JACM)
A Linear Time Algorithm for Finding All Maximal Scoring Subsequences

Proceedings of the Seventh International Conference on Intelligent Systems for Molecular Biology

Reconfigurable hardware solution to parallel prefix computation

The Journal of Supercomputing
A BSP/CGM algorithm for finding all maximal contiguous subsequences of a sequence of numbers

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence

Journal of Discrete Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient algorithms for finding multiple contiguous subsequences of a real-valued sequence having large cumulative sums, in addition to its combinatorial appeal, have widely varying applications such as in textual information retrieval and bioinformatics. A maximum contiguous subsequence of a real-valued sequence is a contiguous subsequence with the maximum cumulative sum. A minimal maximum contiguous subsequence is a minimal contiguous subsequence (with respect to subsequential containment) among all maximum ones of the sequence. We present a logarithmic-time and optimal linear-work parallel algorithm on the parallel random access machine model that finds all successive minimal maximum subsequences of a real-valued sequence.