Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm

Gad M. Landau, Uzi Vishkin. Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm. In Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 28-30 May 1986, Berkeley, California, USA. pages 220-230, ACM, 1986.

@inproceedings{LandauV86,
  title = {Introducing Efficient Parallelism into Approximate String Matching and a New Serial Algorithm},
  author = {Gad M. Landau and Uzi Vishkin},
  year = {1986},
  researchr = {https://researchr.org/publication/LandauV86},
  cites = {0},
  citedby = {0},
  pages = {220-230},
  booktitle = {Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, 28-30 May 1986, Berkeley, California, USA},
  publisher = {ACM},
}