On the public citation graph

An improved algorithm for approximate string matching

https://doi.org/10.1007/bfb0035772
0 signed · 38 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1016/0022-0000(88)90045-1openalex-snapshot
Fast string matching with k differences
inferredcites →https://doi.org/10.1016/0196-6774(84)90021-xopenalex-snapshot
An O(n log n) algorithm for finding all repetitions in a string
inferredcites →https://doi.org/10.1016/0196-6774(89)90010-2openalex-snapshot
Fast parallel and serial approximate string matching
inferredcites →https://doi.org/10.1016/0885-064x(88)90008-8openalex-snapshot
Data structures and algorithms for approximate string matching
inferredcites →https://doi.org/10.1016/s0019-9958(85)80046-2openalex-snapshot
Algorithms for approximate string matching
inferredcites →https://doi.org/10.1137/0206024openalex-snapshot
Fast Pattern Matching in Strings
inferredcites →https://doi.org/10.1145/321796.321811openalex-snapshot
The String-to-String Correction Problem
inferredcites →https://doi.org/10.1145/321879.321880openalex-snapshot
An Extension of the String-to-String Correction Problem
inferredcites →https://doi.org/10.1145/8307.8309openalex-snapshot
Improved string matching with k mismatches

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470892107.ch3openalex-snapshot
Finite Automata in Pattern Matching
inferred← citeshttps://doi.org/10.1007/3-540-44977-9_32openalex-snapshot
Dynamic Programming — NFA Simulation
inferred← citeshttps://doi.org/10.1007/3-540-48057-9_8openalex-snapshot
Implementation of Nondeterministic Finite Automata for Approximate Pattern Matching
inferred← citeshttps://doi.org/10.1007/3-540-52846-6_103openalex-snapshot
Boyer-Moore approach to approximate string matching
inferred← citeshttps://doi.org/10.1007/3-540-53504-7_67openalex-snapshot
Average case analysis of algorithms using matrix recurrences
inferred← citeshttps://doi.org/10.1007/3-540-56024-6_15openalex-snapshot
Fast and practical approximate string matching
inferred← citeshttps://doi.org/10.1007/3-540-58325-4_186openalex-snapshot
Approximate pattern matching with samples
inferred← citeshttps://doi.org/10.1007/3-540-60313-1_153openalex-snapshot
On using q-gram locations in approximate string matching
inferred← citeshttps://doi.org/10.1007/978-1-4613-9323-8_22openalex-snapshot
Approximate string-matching and the q-gram distance
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90188-9openalex-snapshot
Simple and efficient string matching with k mismatches
inferred← citeshttps://doi.org/10.1016/0031-3203(91)90090-ropenalex-snapshot
Parallel (pram erew) algorithms for contour-based 2D shape recognition
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90141-2openalex-snapshot
Fast average-case pattern matching by multiplexing sparse tables
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90143-4openalex-snapshot
Approximate string-matching with q-grams and maximal matches
inferred← citeshttps://doi.org/10.1017/cbo9781316135228openalex-snapshot
Flexible Pattern Matching in Strings
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.001openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.002openalex-snapshot
String matching
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.003openalex-snapshot
Multiple string matching
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.004openalex-snapshot
Extended string matching
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.005openalex-snapshot
Regular expression matching
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.007openalex-snapshot
Conclusion
inferred← citeshttps://doi.org/10.1017/cbo9781316135228.008openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.1109/fscs.1990.89530openalex-snapshot
Approximate string matching in sublinear expected time
inferred← citeshttps://doi.org/10.1109/icpr.1990.119393openalex-snapshot
Using parallel string matching algorithms for contour based 2-D shape recognition
inferred← citeshttps://doi.org/10.1137/0222018openalex-snapshot
Approximate Boyer–Moore String Matching
inferred← citeshttps://doi.org/10.1137/s0097539791195543openalex-snapshot
Tight Bounds on the Complexity of the Boyer–Moore String Matching Algorithm
inferred← citeshttps://doi.org/10.1201/9781420049503-c14openalex-snapshot
General Pattern Matching
inferred← citeshttps://doi.org/10.31390/gradschool_disstheses.5908openalex-snapshot
An Incremental Navigation Localization Methodology for Application to Semi-Autonomous Mobile Robotic Platforms to Assist Individuals Having Severe Motor Disabilities.
inferred← citeshttps://doi.org/10.5109/13427openalex-snapshot
A FAST MATCHING ALGORITHM FOR PATTERNS WITH PICTURES
inferred← citeshttps://doi.org/10.5555/320176.320220openalex-snapshot
Efficient pattern matching with scaling
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.