A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk (Q2799168)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk |
scientific article |
Statements
A Parallel Algorithm for Finding All Minimal Maximum Subsequences via Random Walk (English)
0 references
8 April 2016
0 references
maximum subsequences
0 references
random walk
0 references
message-passing interface
0 references
parallel random access machine
0 references
