scientific article; zbMATH DE number 975393
From MaRDI portal
Publication:5284068
zbMATH Open0863.68056MaRDI QIDQ5284068FDOQ5284068
Authors: Lawrence V. Saxton, Nalin Wijesinghe
Publication date: 9 March 1997
Title of this publication is not available (Why is that?)
Recommendations
error correctionapproximate binary searchapproximate string matching problemspelling correctionsimilar strings
Applications of mathematical programming (90C90) Dynamic programming (90C39) Searching and sorting (68P10)
Cited In (15)
- Generalized String Matching
- Fast string matching in stationary ergodic sources
- Title not available (Why is that?)
- Approximate string matching by fuzzy automata
- A novel look-ahead optimization strategy for trie-based approximate string matching
- Title not available (Why is that?)
- A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM
- A Memory-Efficient and Modular Approach for Large-Scale String Pattern Matching
- Efficient techniques for approximate record matching modulo permutations
- Optimal spaced seeds for faster approximate string matching
- Title not available (Why is that?)
- A fast VLSI solution for approximate string matching
- Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time
- Fast approximate search in large dictionaries
- An approximate string-matching algorithm
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)