Two parallel algorithms for finding all minimal maximum subsequences

DOI10.1016/j.jcss.2018.11.001zbMath1423.68577OpenAlexW2900902043MaRDI QIDQ2424687

H. K. Dai, Z. Wang

Publication date: 25 June 2019

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2018.11.001

zbMATH Keywords

parallel algorithmrandom walkmessage-passing interfaceparallel random-access machinemaximum subsequences

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Parallel algorithms in computer science (68W10) Algorithms on strings (68W32)

Related Items

Special issue: Selected papers of the 9th international conference on language and automata theory and applications, LATA 2015

Uses Software

• ALPBench

Cites Work

• Unnamed Item
• Unnamed Item
• Randomized algorithm for the sum selection problem
• Statistical composition of high-scoring segments from molecular sequences
• Strong limit theorems of empirical functionals for large exceedances of partial sums of i.i.d. variables
• On calculation of moments of ladder heights
• A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk
• Methods for assessing the statistical significance of molecular sequence features by using general scoring schemes.
• An Algorithm for a Generalized Maximum Subsequence Problem
• A Parallel Algorithm for Finding All Successive Minimal Maximum Subsequences
• Parallel Prefix Computation
• APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM
• Limit distributions of maximal segmental score among Markov-dependent partial sums
• The Parallel Evaluation of General Arithmetic Expressions
• Applied Probability and Queues
• Communication efficient BSP algorithm for all nearest smaller values problem