scientific article; zbMATH DE number 4119620
From MaRDI portal
zbMATH Open0683.68034MaRDI QIDQ4733401FDOQ4733401
Authors: Zvi Galil, Kunsoo Park 
Publication date: 1989
Title of this publication is not available (Why is that?)
Recommendations
Cited In (27)
- Simple and efficient string matching with k mismatches
- Fast parallel and serial approximate string matching
- Approximate string-matching with \(q\)-grams and maximal matches
- Faster algorithm of string comparison
- On using q-gram locations in approximate string matching
- Dynamic programming for reduced NFAs for approximate string and sequence matching.
- Faster algorithms for string matching with k mismatches
- An \(O(n\log n)\) algorithm for finding dissimilar strings
- Title not available (Why is that?)
- A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM
- Approximate string matching using factor automata
- Dynamic programming with convexity, concavity and sparsity
- Boosting the Quality of Approximate String Matching by Synonyms
- An improved algorithm for solving the banded cyclic string-to-string correction problem
- \(k\)-difference matching in amortized linear time for all the words in a text
- An Improved Algorithm For Approximate String Matching
- Title not available (Why is that?)
- An integer linear programming approach for approximate string comparison
- String matching with weighted errors
- Approximate Boyer–Moore String Matching
- Fast average-case pattern matching by multiplexing sparse tables
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximate String Matching: A Simpler Faster Algorithm
- A new filtration method and a hybrid strategy for approximate string matching
- Boyer-Moore approach to approximate 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 Q4733401)
