Very fast and simple approximate string matching
DOI10.1016/S0020-0190(99)00121-0zbMATH Open1338.68305WikidataQ126772463 ScholiaQ126772463MaRDI QIDQ294703FDOQ294703
Authors: Gonzalo Navarro, Ricardo Baeza-Yates 
Publication date: 16 June 2016
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019099001210?np=y
Recommendations
Information storage and retrieval of data (68P20) Algorithms on strings (68W32) Computing methodologies for text processing; mathematical typography (68U15)
Cites Work
Cited In (14)
- Creating improvisations on chord progressions using suffix trees
- Simple, compact and robust approximate string dictionary
- Fast string matching with k differences
- NR-grep: A fast and flexible pattern-matching tool
- Improving an algorithm for approximate pattern matching
- Approximate string matching with compressed indexes
- Fast approximate search in large dictionaries
- Fast and practical approximate string matching
- Faster filters for approximate string matching
- An artificial neural network based approach for online string matching/filtering of large databases
- New and faster filters for multiple approximate string matching
- Combinatorial Pattern Matching
- Approximate String Matching: A Simpler Faster Algorithm
- A new filtration method and a hybrid strategy for approximate string matching
Uses Software
This page was built for publication: Very fast and simple approximate string matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294703)
