On the public citation graph
Fast two-dimensional approximate pattern matching
0 signed · 41 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.1007/3-540-09510-1_10openalex-snapshot
A string matching algorithm fast on the average
inferredcites →https://doi.org/10.1007/3-540-56024-6_14openalex-snapshot
Theoretical and empirical comparisons of approximate string matching algorithms
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-60313-1_153openalex-snapshot
On using q-gram locations in approximate string matching
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/3-540-61258-0_23openalex-snapshot
Alphabet independent and dictionary scaled matching
inferredcites →https://doi.org/10.1007/3-540-61258-0_24openalex-snapshot
Analysis of two-dimensional approximate pattern matching algorithms
inferredcites →https://doi.org/10.1007/3-540-61258-0_7openalex-snapshot
Approximate multiple string search
inferredcites →https://doi.org/10.1007/3-540-63307-3_57openalex-snapshot
Multiple approximate string matching
inferredcites →https://doi.org/10.1007/3-540-68535-9_36openalex-snapshot
Similarity in Two-Dimensional Strings
inferredcites →https://doi.org/10.1007/bf01942606openalex-snapshot
A Subquadratic Algorithm for Approximate Limited Expression Matching
inferredcites →https://doi.org/10.1007/bfb0030785openalex-snapshot
A rotation invariant filter for two-dimensional string matching
inferredcites →https://doi.org/10.1007/pl00009253openalex-snapshot
Faster Approximate String Matching
inferredcites →https://doi.org/10.1016/0020-0190(77)90017-5openalex-snapshot
Two dimensional pattern matching
inferredcites →https://doi.org/10.1016/0020-0190(93)90250-dopenalex-snapshot
Fast two-dimensional pattern matching
inferredcites →https://doi.org/10.1016/0020-0255(87)90037-5openalex-snapshot
Efficient two-dimensional pattern matching in the presence of errors
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-2836(70)90057-4openalex-snapshot
A general method applicable to the search for similarities in the amino acid sequence of two proteins
inferredcites →https://doi.org/10.1016/0196-6774(80)90016-4openalex-snapshot
The theory and computation of evolutionary distances: Pattern recognition
inferredcites →https://doi.org/10.1016/0196-6774(85)90023-9openalex-snapshot
Finding approximate patterns in strings
inferredcites →https://doi.org/10.1016/0304-3975(91)90318-vopenalex-snapshot
Fast parallel and serial multidimensional approximate array matching
inferredcites →https://doi.org/10.1137/0207043openalex-snapshot
A Technique for Extending Rapid Exact-Match String Matching to Arrays of More than One Dimension
inferredcites →https://doi.org/10.1137/s0097539794275872openalex-snapshot
Two- and Higher-Dimensional Pattern Matching in Optimal Expected Time
inferredcites →https://doi.org/10.1145/66451.66459openalex-snapshot
A technique for two-dimensional pattern matching
inferredcites →https://doi.org/10.1515/9780773591400-012openalex-snapshot
Multiple Approximate String Matching by Counting
inferredcites →https://doi.org/10.5555/127787.127829openalex-snapshot
Efficient 2-dimensional approximate matching of non-rectangular figures
inferredcites →https://doi.org/10.5555/314464.314680openalex-snapshot
Two and higher dimensional pattern matching in optimal expected time
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11415763_8openalex-snapshot
Mining Semantic Structures in Movies
inferred← citeshttps://doi.org/10.1007/3-540-44929-9_5openalex-snapshot
An Index for Two Dimensional String Matching Allowing Rotations
inferred← citeshttps://doi.org/10.1007/3-540-48194-x_3openalex-snapshot
Approximate Matching of Run-Length Compressed Strings
inferred← citeshttps://doi.org/10.1007/3-540-48452-3_18openalex-snapshot
Fast Multi-dimensional Approximate Pattern Matching
inferred← citeshttps://doi.org/10.1007/3-540-68535-9_36openalex-snapshot
Similarity in Two-Dimensional Strings
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_5openalex-snapshot
A Largest Common d-Dimensional Subsequence of Two d-Dimensional Strings
inferred← citeshttps://doi.org/10.1007/s10994-005-5829-2openalex-snapshot
Discovery of Time-Series Motif from Multi-Dimensional Data Based on MDL Principle
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.02.022openalex-snapshot
A new filtration method and a hybrid strategy for approximate string matching
inferred← citeshttps://doi.org/10.1109/spire.2000.878185openalex-snapshot
Rotation invariant histogram filters for similarity and distance measures between digital images
inferred← citeshttps://doi.org/10.1145/375360.375365openalex-snapshot
A guided tour to approximate string matching
inferred← citeshttps://doi.org/10.1504/ijiids.2012.050097openalex-snapshot
Pattern discovery in annotated dialogues using dynamic programming
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.