Approximate string matching with suffix automata
- 1 November 1993
- journal article
- Published by Springer Nature in Algorithmica
- Vol. 10 (5), 353-364
- https://doi.org/10.1007/bf01769703
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Fast parallel and serial approximate string matchingJournal of Algorithms, 1989
- Fast string matching with k differencesJournal of Computer and System Sciences, 1988
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Time optimal left to right construction of position treesActa Informatica, 1987
- AnO(ND) difference algorithm and its variationsAlgorithmica, 1986
- Transducers and repetitionsTheoretical Computer Science, 1986
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- Efficient string matchingCommunications of the ACM, 1975
- The String-to-String Correction ProblemJournal of the ACM, 1974