On the public citation graph

Faster Algorithms for δ,γ-Matching and Related Problems

0 signed · 42 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.1006/inco.1995.1047openalex-snapshot
Efficient 2-Dimensional Approximate Matching of Half-Rectangular Figures
inferredcites →https://doi.org/10.1007/11496656_9openalex-snapshot
Approximate Matching in the L 1 Metric
inferredcites →https://doi.org/10.1007/3-540-10003-2_79openalex-snapshot
On observing nondeterminism and concurrency
inferredcites →https://doi.org/10.1007/978-3-540-27836-8_66openalex-snapshot
Closest Pair Problems in Very High Dimensions
inferredcites →https://doi.org/10.1007/s00500-004-0384-5openalex-snapshot
Approximate string matching for music analysis
inferredcites →https://doi.org/10.1016/s0020-0190(02)00430-1openalex-snapshot
On special families of morphisms related to δ-matching and don't care symbols
inferredcites →https://doi.org/10.1057/jors.1991.155openalex-snapshot
Introduction to Algorithms
inferredcites →https://doi.org/10.1080/00207160213939openalex-snapshot
Algorithms For Computing Approximate Repetitions In Musical Sequences
inferredcites →https://doi.org/10.1137/0216067openalex-snapshot
Generalized String Matching
inferredcites →https://doi.org/10.1137/s1064827593247023openalex-snapshot
Accuracy of the Discrete Fourier Transform and the Fast Fourier Transform
inferredcites →https://doi.org/10.1145/509907.509992openalex-snapshot
Verifying candidate matches in sparse and wildcard matching

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11496656_9openalex-snapshot
Approximate Matching in the L 1 Metric
inferred← citeshttps://doi.org/10.1007/11575832_27openalex-snapshot
Necklace Swap Problem for Rhythmic Similarity Measures
inferred← citeshttps://doi.org/10.1007/11575832_36openalex-snapshot
L 1 Pattern Matching Lower Bound
inferred← citeshttps://doi.org/10.1007/11575832_37openalex-snapshot
Approximate Matching in the L ∞ Metric
inferred← citeshttps://doi.org/10.1007/11751595_119openalex-snapshot
Algorithms on Extended (δ, γ)-Matching
inferred← citeshttps://doi.org/10.1007/11841036_17openalex-snapshot
Necklaces, Convolutions, and X + Y
inferred← citeshttps://doi.org/10.1007/978-3-030-51466-2_32openalex-snapshot
Recent Advances in Text-to-Pattern Distance Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-540-69068-9_15openalex-snapshot
A Black Box for Online Approximate Pattern Matching
inferred← citeshttps://doi.org/10.1007/978-3-540-73437-6_9openalex-snapshot
Self-normalised Distance with Don’t Cares
inferred← citeshttps://doi.org/10.1007/978-3-540-75530-2_9openalex-snapshot
Jump-Matching with Errors
inferred← citeshttps://doi.org/10.1007/978-3-540-89097-3_23openalex-snapshot
δγ – Parameterized Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-10217-2_26openalex-snapshot
Fast Convolutions and Their Applications in Approximate String Matching
inferred← citeshttps://doi.org/10.1007/s00453-012-9734-3openalex-snapshot
Necklaces, Convolutions, and X+Y
inferred← citeshttps://doi.org/10.1007/s10489-021-03000-2openalex-snapshot
NetDPO: (delta, gamma)-approximate pattern matching with gap constraints under one-off condition
inferred← citeshttps://doi.org/10.1016/j.ejc.2012.07.013openalex-snapshot
Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching
inferred← citeshttps://doi.org/10.1016/j.ic.2010.12.007openalex-snapshot
A black box for online approximate pattern matching
inferred← citeshttps://doi.org/10.1016/j.ic.2022.104924openalex-snapshot
Order-preserving pattern matching indeterminate strings
inferred← citeshttps://doi.org/10.1016/j.ins.2006.11.012openalex-snapshot
All maximal-pairs in step–leap representation of melodic sequence
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.08.011openalex-snapshot
pattern matching lower bound
inferred← citeshttps://doi.org/10.1016/j.ipl.2007.08.012openalex-snapshot
Approximate matching in the metric
inferred← citeshttps://doi.org/10.1016/j.ipl.2013.07.002openalex-snapshot
Approximate pattern matching with k-mismatches in packed text
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.03.001openalex-snapshot
On approximate pattern matching with thresholds
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.006openalex-snapshot
Order-preserving matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.01.003openalex-snapshot
Set Intersection and Sequence Matching with mismatch counting
inferred← citeshttps://doi.org/10.1093/ietisy/e91-d.6.1824openalex-snapshot
A Simple Algorithm for Transposition-Invariant Amplified ( , )-Matching
inferred← citeshttps://doi.org/10.1142/s0129054106004455openalex-snapshot
FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME
inferred← citeshttps://doi.org/10.3233/ida-216325openalex-snapshot
NetNDP: Nonoverlapping (delta, gamma)-approximate pattern matching
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2019.15openalex-snapshot
Approximating Approximate Pattern Matching
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2020.29openalex-snapshot
Approximating Text-To-Pattern Distance via Dimensionality Reduction
inferred← citeshttps://doi.org/10.48550/arxiv.1212.4771openalex-snapshot
Necklaces, Convolutions, and X+Y
inferred← citeshttps://doi.org/10.48550/arxiv.1801.09159openalex-snapshot
Faster Approximate(d) Text-to-Pattern L1 Distance
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.