Parallel string matching with k mismatches
Open Access
- 31 December 1987
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 51 (3) , 341-348
- https://doi.org/10.1016/0304-3975(87)90042-9
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Efficient string matching with k mismatchesTheoretical Computer Science, 1986
- Improved string matching with k mismatchesACM SIGACT News, 1986
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- An Efficient General-Purpose Parallel ComputerJournal of the ACM, 1983
- A Space-Economical Suffix Tree Construction AlgorithmJournal of the ACM, 1976