Fast string matching with k differences
- 1 August 1988
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 37 (1) , 63-78
- https://doi.org/10.1016/0022-0000(88)90045-1
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Efficient randomized pattern-matching algorithmsIBM Journal of Research and Development, 1987
- Efficient string matching with k mismatchesTheoretical Computer Science, 1986
- An efficient string matching algorithm withkdifferences for nudeotide and amino acid sequencesNucleic Acids Research, 1986
- Optimal parallel algorithms for string matchingInformation and Control, 1985
- RECOGNITION OF AN APPROXIMATE OCCURRENCE OF WORDS ON A TURING MACHINE IN REAL TIMEMathematics of the USSR-Izvestiya, 1985
- Finding approximate patterns in stringsJournal of Algorithms, 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