scientific article; zbMATH DE number 4119620

MaRDI QIDQ4733401zbMATH OpenFDO

Authors Zvi Galil, Kunsoo Park

Publication date 1989

zbMATH Keywords

complexity of algorithmsstring matching

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Fast string matching with k differences
• An Improved Algorithm For Approximate String Matching
• Fast parallel and serial approximate string matching
• Boyer-Moore approach to approximate string matching
• scientific article; zbMATH DE number 1303588

Cited in

(28)

• \(k\)-difference matching in amortized linear time for all the words in a text
• An integer linear programming approach for approximate string comparison
• An improved algorithm for solving the banded cyclic string-to-string correction problem
• Dynamic programming with convexity, concavity and sparsity
• Fast average-case pattern matching by multiplexing sparse tables
• Approximate string-matching with q-grams and maximal matches
• Faster algorithm of string comparison
• Approximate string matching using factor automata
• An \(O(n\log n)\) algorithm for finding dissimilar strings
• Dynamic programming for reduced NFAs for approximate string and sequence matching.
• Approximate String Matching: A Simpler Faster Algorithm
• An Improved Algorithm For Approximate String Matching
• A new filtration method and a hybrid strategy for approximate string matching
• Approximate Boyer–Moore String Matching
• Fast parallel and serial approximate string matching
• scientific article; zbMATH DE number 4126691 (Why is no real title available?)
• scientific article; zbMATH DE number 1303588 (Why is no real title available?)
• scientific article; zbMATH DE number 710402 (Why is no real title available?)
• scientific article; zbMATH DE number 1094183 (Why is no real title available?)
• scientific article; zbMATH DE number 1857503 (Why is no real title available?)
• Faster algorithms for string matching with k mismatches
• scientific article; zbMATH DE number 2112173 (Why is no real title available?)
• Boosting the Quality of Approximate String Matching by Synonyms
• Boyer-Moore approach to approximate string matching
• A NOVEL ALGORITHM FOR SOLVING THE STRING MATCHING PROBLEM
• Simple and efficient string matching with k mismatches
• On using q-gram locations in approximate string matching
• String matching with weighted errors

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)