Data structures and algorithms for approximate string matching
- 1 March 1988
- journal article
- Published by Elsevier in Journal of Complexity
- Vol. 4 (1) , 33-72
- https://doi.org/10.1016/0885-064x(88)90008-8
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Parallel string matching with k mismatchesTheoretical Computer Science, 1987
- Generalized String MatchingSIAM Journal on Computing, 1987
- The longest common subsequence problem revisitedAlgorithmica, 1987
- Improved string matching with k mismatchesACM SIGACT News, 1986
- An Efficient General-Purpose Parallel ComputerJournal of the ACM, 1983
- Parallel Prefix ComputationJournal of the ACM, 1980
- A fast string searching algorithmCommunications of the ACM, 1977
- A linear space algorithm for computing maximal common subsequencesCommunications of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974