Approximate string-matching over suffix trees
- 1 December 2005
- book chapter
- Published by Springer Nature
- p. 228-242
- https://doi.org/10.1007/bfb0029808
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- String matching with constraintsPublished by Springer Nature ,2005
- Approximate string matching in sublinear expected timePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Theoretical and empirical comparisons of approximate string matching algorithmsPublished by Springer Nature ,1992
- An Improved Algorithm For Approximate String MatchingSIAM Journal on Computing, 1990
- Basic local alignment search toolJournal of Molecular Biology, 1990
- Fast string matching with k differencesJournal of Computer and System Sciences, 1988
- Data structures and algorithms for approximate string matchingJournal of Complexity, 1988
- Transducers and repetitionsTheoretical Computer Science, 1986
- The smallest automation recognizing the subwords of a textTheoretical Computer Science, 1985
- Approximate String MatchingACM Computing Surveys, 1980