A sublinear algorithm for approximate keyword searching
- 1 November 1994
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 12 (4-5), 345-374
- https://doi.org/10.1007/bf01185432
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Approximate string matching in sublinear expected timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Basic local alignment search toolJournal of Molecular Biology, 1990
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986
- Introducing efficient parallelism into approximate string matching and a new serial algorithmPublished by Association for Computing Machinery (ACM) ,1986
- Computer program for the IBM personal computer which searches for approximate matches to short oligonucleotide sequences in long target DNA sequencesNucleic Acids Research, 1986
- Finding approximate patterns in stringsJournal of Algorithms, 1985
- The theory and computation of evolutionary distances: Pattern recognitionJournal of Algorithms, 1980
- A fast string searching algorithmCommunications of the ACM, 1977
- Fast Pattern Matching in StringsSIAM Journal on Computing, 1977