A dominant point-based parallel algorithm that finds all longest common subsequences for a constrained-MLCS problem.
Armel Nkonjoh NgomadeJean Frédéric MyoupoVianney Kengne TchendjiPublished in: J. Comput. Sci. (2020)
Keyphrases
- parallel algorithm
- longest common subsequence
- parallel computation
- shared memory
- parallel programming
- medial axis transform
- parallel implementations
- discovery of association rules
- edit distance
- search space
- parallel processing
- dynamic time warping
- parallel version
- message passing interface
- processor array
- cluster of workstations