On the public citation graph

Approximate Matching in the L 1 Metric

0 signed · 51 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_7openalex-snapshot
Faster Algorithms for δ,γ-Matching and Related Problems
inferredcites →https://doi.org/10.1007/3-540-45061-0_72openalex-snapshot
Function Matching: Algorithms, Applications, and a Lower Bound
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/978-3-540-30140-0_4openalex-snapshot
Swap and Mismatch Edit Distance
inferredcites →https://doi.org/10.1007/978-3-642-82456-2openalex-snapshot
Combinatorial Algorithms on Words
inferredcites →https://doi.org/10.1007/978-3-642-82456-2_1openalex-snapshot
Open Problems in Stringology
inferredcites →https://doi.org/10.1007/s00453-005-1192-8openalex-snapshot
Swap and mismatch edit distance
inferredcites →https://doi.org/10.1016/0020-0190(93)90177-bopenalex-snapshot
Fast algorithms for approximately counting mismatches
inferredcites →https://doi.org/10.1016/0304-3975(86)90178-7openalex-snapshot
Efficient string matching with k mismatches
inferredcites →https://doi.org/10.1016/s0196-6774(03)00097-xopenalex-snapshot
Faster algorithms for string matching with k mismatches
inferredcites →https://doi.org/10.1016/s0304-4076(01)00125-7openalex-snapshot
Entropy and predictability of stock market returns
inferredcites →https://doi.org/10.1016/s0890-5401(02)00035-4openalex-snapshot
Overlap matching
inferredcites →https://doi.org/10.1023/a:1002629217152openalex-snapshot
Perceptual Issues in Music Pattern Recognition: Complexity of Rhythm and Key Finding
inferredcites →https://doi.org/10.1109/swat.1973.13openalex-snapshot
Linear pattern matching algorithms
inferredcites →https://doi.org/10.1126/science.270.5235.394openalex-snapshot
A Time to Sequence
inferredcites →https://doi.org/10.1137/0213024openalex-snapshot
Fast Algorithms for Finding Nearest Common Ancestors
inferredcites →https://doi.org/10.1137/0216067openalex-snapshot
Generalized String Matching
inferredcites →https://doi.org/10.1145/321941.321946openalex-snapshot
A Space-Economical Suffix Tree Construction Algorithm
inferredcites →https://doi.org/10.1145/509907.509992openalex-snapshot
Verifying candidate matches in sparse and wildcard matching
inferredcites →https://doi.org/10.1145/73007.73036openalex-snapshot
Highly parallelizable problems
inferredcites →https://doi.org/10.1145/8307.8309openalex-snapshot
Improved string matching with k mismatches
inferredcites →https://doi.org/10.1785/0119990152openalex-snapshot
Ground-Motion Scaling in the Apennines (Italy)
inferredcites →https://doi.org/10.5555/545381.545470openalex-snapshot
The string edit distance matching problem with moves

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_7openalex-snapshot
Faster Algorithms for δ,γ-Matching and Related Problems
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/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_21openalex-snapshot
Approximated Pattern Matching with the L 1, L 2 and L ∞ Metrics
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/s00138-010-0290-zopenalex-snapshot
Graph-based shape indexing
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.tcs.2013.10.006openalex-snapshot
Order-preserving matching
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.10.013openalex-snapshot
Modulated string searching
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.1109/dcc.2005.73openalex-snapshot
Prediction by Partial Approximate Matching for Lossless Image Compression
inferred← citeshttps://doi.org/10.1109/focs.2015.43openalex-snapshot
Breaking the Variance: Approximating the Hamming Distance in 1/ε Time Per Alignment
inferred← citeshttps://doi.org/10.1109/tip.2008.920772openalex-snapshot
Prediction by Partial Approximate Matching for Lossless Image Compression
inferred← citeshttps://doi.org/10.1142/s0129054106004455openalex-snapshot
FLEXIBLE MUSIC RETRIEVAL IN SUBLINEAR TIME
inferred← citeshttps://doi.org/10.1561/2000000038openalex-snapshot
Pattern Matching in Compressed Texts and Images
inferred← citeshttps://doi.org/10.4230/lipics.cpm.2019.15openalex-snapshot
Approximating Approximate Pattern Matching
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.