scientific article; zbMATH DE number 975393

MaRDI QIDQ5284068zbMATH OpenFDO

Authors Lawrence V. Saxton, Nalin Wijesinghe

Publication date 9 March 1997

zbMATH Keywords

error correctionapproximate binary searchapproximate string matching problemspelling correctionsimilar strings

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Dynamic programming (90C39) Searching and sorting (68P10)

Recommendations

• Fast approximate matching of words against a dictionary
• A fast bit-vector algorithm for approximate string matching based on dynamic programming
• Faster approximate string matching
• Fast and practical approximate string matching

Cited in

(15)

• Optimal spaced seeds for faster approximate string matching
• An approximate string-matching algorithm
• A Memory-Efficient and Modular Approach for Large-Scale String Pattern Matching
• Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time
• A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM
• scientific article; zbMATH DE number 5684815 (Why is no real title available?)
• Approximate string matching by fuzzy automata
• scientific article; zbMATH DE number 2149348 (Why is no real title available?)
• Fast string matching in stationary ergodic sources
• A fast VLSI solution for approximate string matching
• Efficient techniques for approximate record matching modulo permutations
• scientific article; zbMATH DE number 1949661 (Why is no real title available?)
• A novel look-ahead optimization strategy for trie-based approximate string matching
• Fast approximate search in large dictionaries
• Generalized String Matching

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5284068)