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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Dai, H. K., & Su, H. C. (2006). A parallel algorithm for finding all successive minimal maximum subsequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3887 LNCS, pp. 337–348). Springer Verlag. https://doi.org/10.1007/11682462_33
Mendeley helps you to discover research relevant for your work.