On the public citation graph
A unified view to string matching algorithms
0 signed · 44 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/spe.4380240402openalex-snapshot
Approximate string matching using withinword parallelism
inferredcites →https://doi.org/10.1006/jagm.1995.1041openalex-snapshot
A Subquadratic Algorithm for Approximate Regular Expression Matching
inferredcites →https://doi.org/10.1007/3-540-56024-6_15openalex-snapshot
Fast and practical approximate string matching
inferredcites →https://doi.org/10.1007/3-540-58131-6_61openalex-snapshot
String matching algorithms and automata
inferredcites →https://doi.org/10.1007/3-540-60268-2_315openalex-snapshot
Approximate string matching by finite automata
inferredcites →https://doi.org/10.1007/3-540-61258-0_1openalex-snapshot
A faster algorithm for approximate string matching
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_2openalex-snapshot
Efficient String Matching with Don’t-Care Patterns
inferredcites →https://doi.org/10.1007/bf01185432openalex-snapshot
A sublinear algorithm for approximate keyword searching
inferredcites →https://doi.org/10.1007/bf02458834openalex-snapshot
Approximate matching of regular expressions
inferredcites →https://doi.org/10.1007/bfb0037393openalex-snapshot
A unified view to string matching algorithms
inferredcites →https://doi.org/10.1016/0020-0190(91)90032-dopenalex-snapshot
An algorithm for string matching with a sequence of don't cares
inferredcites →https://doi.org/10.1016/0020-0190(93)90177-bopenalex-snapshot
Fast algorithms for approximately counting mismatches
inferredcites →https://doi.org/10.1016/0020-0190(95)00043-copenalex-snapshot
A fast algorithm for string matching with mismatches
inferredcites →https://doi.org/10.1016/0022-0000(88)90045-1openalex-snapshot
Fast string matching with k differences
inferredcites →https://doi.org/10.1016/0022-0000(93)90040-4openalex-snapshot
Surpassing the information theoretic bound with fusion trees
inferredcites →https://doi.org/10.1016/0196-6774(85)90023-9openalex-snapshot
Finding approximate patterns in strings
inferredcites →https://doi.org/10.1016/s0019-9958(85)80046-2openalex-snapshot
Algorithms for approximate string matching
inferredcites →https://doi.org/10.1137/0219067openalex-snapshot
An Improved Algorithm For Approximate String Matching
inferredcites →https://doi.org/10.1145/128749.128755openalex-snapshot
A Four Russians algorithm for regular expression pattern matching
inferredcites →https://doi.org/10.1145/135239.135243openalex-snapshot
A new approach to text searching
inferredcites →https://doi.org/10.1145/359842.359859openalex-snapshot
A fast string searching algorithm
inferredcites →https://doi.org/10.1145/363347.363387openalex-snapshot
Programming Techniques: Regular expression search algorithm
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11554028_70openalex-snapshot
A Programmable Pipelined Queue for Approximate String Matching
inferred← citeshttps://doi.org/10.1007/3-540-45452-7_18openalex-snapshot
Faster Bit-Parallel Approximate String Matching
inferred← citeshttps://doi.org/10.1007/3-540-61258-0_1openalex-snapshot
A faster algorithm for approximate string matching
inferred← citeshttps://doi.org/10.1007/978-3-031-52113-3_23openalex-snapshot
Shortest Characteristic Factors of a Deterministic Finite Automaton and Computing Its Positive Position Run by Pattern Set Matching
inferred← citeshttps://doi.org/10.1007/s00224-011-9322-yopenalex-snapshot
Faster Approximate String Matching for Short Patterns
inferred← citeshttps://doi.org/10.1007/s00236-025-00484-0openalex-snapshot
Shortest characteristic factors of a deterministic finite automaton and computing its positive position run by pattern set matching
inferred← citeshttps://doi.org/10.1007/s00453-004-1108-zopenalex-snapshot
Bit-Parallel Witnesses and Their Applications to Approximate String Matching
inferred← citeshttps://doi.org/10.1016/j.jda.2006.10.005openalex-snapshot
Efficient generation of super condensed neighborhoods
inferred← citeshttps://doi.org/10.1016/j.sysarc.2007.03.004openalex-snapshot
Processor array architectures for flexible approximate string matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.016openalex-snapshot
Exact matching of RNA secondary structure patterns
inferred← citeshttps://doi.org/10.1080/00207160212111openalex-snapshot
On-Line Approximate String Searching Algorithms: Survey and Experimental Results
inferred← citeshttps://doi.org/10.1145/375360.375365openalex-snapshot
A guided tour to approximate string matching
inferred← citeshttps://doi.org/10.11606/d.3.2006.tde-18042007-155841openalex-snapshot
Aplicação de autômatos finitos nebulosos no reconhecimento aproximado de cadeias.
inferred← citeshttps://doi.org/10.32657/10356/2470openalex-snapshot
Framework forensic examination computer systems
showing the first 14 of 15 · page through all 15
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.