Fast parallel and serial multidimensional approximate array matching
Authors:
- Amihood AmirAAAmihood Amir
- Gad M. LandauGLGad M. Landau
- 22 April 1991
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 81 (1) , 97-115
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Parallel construction of a suffix tree with applicationsAlgorithmica, 1988
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Parallel string matching with k mismatchesTheoretical Computer Science, 1987
- Improved string matching with k mismatchesACM SIGACT News, 1986
- Fast Algorithms for Finding Nearest Common AncestorsSIAM Journal on Computing, 1984
- Time-space-optimal string matchingJournal of Computer and System Sciences, 1983
- A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One DimensionSIAM Journal on Computing, 1978
- Two dimensional pattern matchingInformation Processing Letters, 1977
- A fast string searching algorithmCommunications of the ACM, 1977
- Efficient string matchingCommunications of the ACM, 1975