Fast parallel and serial approximate string matching
- 1 June 1989
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 10 (2) , 157-169
- https://doi.org/10.1016/0196-6774(89)90010-2
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Parallel string matching with k mismatchesTheoretical Computer Science, 1987
- Efficient randomized pattern-matching algorithmsIBM Journal of Research and Development, 1987
- Efficient string matching with k mismatchesTheoretical Computer Science, 1986
- Improved string matching with k mismatchesACM SIGACT News, 1986
- Optimal parallel algorithms for string matchingInformation and Control, 1985
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977