A coarse-grained multicomputer parallel algorithm for the sequential substring constrained longest common subsequence problem.
Vianney Kengne TchendjiHermann Bogning TepieleMathias Akong OnabidJean Frédéric MyoupoJerry Lacmou ZeutouoPublished in: Parallel Comput. (2022)
Keyphrases
- coarse grained
- parallel algorithm
- shared memory
- parallel version
- fine grained
- beam search
- parallel computation
- distributed memory
- parallel computing
- inter processor communication
- cluster of workstations
- heuristic search
- protein sequences
- search problems
- computer architecture
- multithreading
- high level
- image segmentation
- access control
- search algorithm
- data structure
- evolutionary algorithm