Coarse-Grained Multicomputer Based-Parallel Algorithms for the Longest Common Subsequence Problem with a String-Exclusion Constraint.
Jean Frédéric MyoupoArmel Nkonjoh NgomadeVianney Kengne TchendjiPublished in: HPCS (2018)
Keyphrases
- coarse grained
- parallel algorithm
- shared memory
- fine grained
- beam search
- parallel computation
- distributed memory
- parallel computing
- high level
- protein sequences
- data structure
- computer architecture
- message passing
- pc cluster
- heuristic search
- search problems
- ranking functions
- branch and bound
- orders of magnitude
- search algorithm
- objective function