Sequential and Parallel Approximation of Shortest Superstrings.
Artur CzumajLeszek GasieniecMarek PiotrówWojciech RytterPublished in: J. Algorithms (1997)
Keyphrases
- shortest common supersequence
- parallel processing
- parallel implementation
- parallel version
- shared memory
- approximation error
- distributed memory
- parallel computation
- closed form
- real time
- efficient computation
- approximation algorithms
- databases
- parallel architectures
- queueing networks
- information retrieval
- image processing
- evolutionary algorithm
- computational complexity
- multi agent
- bayesian networks
- similarity measure
- image sequences
- database systems