A Coarse-Grained Parallel Algorithm for the All-Substrings Longest Common Subsequence Problem.
Carlos E. R. AlvesEdson CáceresSiang Wun SongPublished in: Algorithmica (2006)
Keyphrases
- parallel algorithm
- coarse grained
- beam search
- shared memory
- fine grained
- heuristic search
- search algorithm
- branch and bound
- search methods
- parallel computation
- distributed memory
- search problems
- hill climbing
- parallel computing
- high level
- protein sequences
- medial axis transform
- search engine
- ranking functions
- user queries
- binary search trees
- cluster of workstations