Optimal Parallel Dictionary Matching and Compression

@inproceedings{Farach1995OptimalPD,
  title={Optimal Parallel Dictionary Matching and Compression},
  author={Martin Farach},
  year={1995}
}
Emerging applications in multi-media and the Human Genome Project require storage and searching of large databases of strings { a task for which parallelism seems the only hope. In this paper, we consider the parallelism in some of the fundamental problems in compressing strings and in matching large dictionaries of patterns against texts. We present the rst work-optimal algorithms for these well-studied problems including the classical dictionary matching problem, optimal compression with a… CONTINUE READING