Faster approximate string matching

DOI10.1007/PL00009253zbMath0913.68050OpenAlexW2168459716MaRDI QIDQ1277393

Ricardo A. Baeza-Yates, Gonzalo Navarro

Publication date: 7 June 1999

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/pl00009253

zbMATH Keywords

string matchingtext searchingnondeterministic finite automaton

Mathematics Subject Classification ID

Searching and sorting (68P10) Computing methodologies for text processing; mathematical typography (68U15)

Related Items (19)

Matching regular expressions on uncertain data ⋮ New and faster filters for multiple approximate string matching ⋮ Very fast and simple approximate string matching ⋮ Multiple serial episodes matching ⋮ Fast and compact regular expression matching ⋮ On-Line Approximate String Searching Algorithms: Survey and Experimental Results ⋮ Practical and flexible pattern matching over Ziv-Lempel compressed text. ⋮ A new filtration method and a hybrid strategy for approximate string matching ⋮ Run-Length Encoded Nondeterministic KMP and Suffix Automata ⋮ Fast Approximate Search in Large Dictionaries ⋮ Improving the bit-parallel NFA of Baeza-Yates and Navarro for approximate string matching ⋮ NR‐grep: a fast and flexible pattern‐matching tool ⋮ Index structures for fast similarity search for symbol strings ⋮ Approximate string matching on Ziv--Lempel compressed text ⋮ Indexing text with approximate \(q\)-grams ⋮ Bit-parallel (\(\delta ,\gamma\))-matching and suffix automata ⋮ Bit-parallel approximate string matching algorithms with transposition ⋮ Fast and practical approximate string matching ⋮ Finding approximate palindromes in strings

This page was built for publication: Faster approximate string matching