On the public citation graph

Classes of cost functions for string edit distance

https://doi.org/10.1007/bf02526038
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.1007/bf01185430openalex-snapshot
Parametric optimization of sequence alignment
inferredcites →https://doi.org/10.1007/bf01840446openalex-snapshot
AnO(ND) difference algorithm and its variations
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50010-2openalex-snapshot
Algorithms for Finding 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.1109/21.362950openalex-snapshot
Parametric string edit distance and its application to pattern recognition
inferredcites →https://doi.org/10.1109/icdar.1993.395703openalex-snapshot
Performance metrics for document understanding systems
inferredcites →https://doi.org/10.1145/321796.321811openalex-snapshot
The String-to-String Correction Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11610113_74openalex-snapshot
XMine: A Methodology for Mining XML Structure
inferred← citeshttps://doi.org/10.1007/978-1-4615-4401-2_10openalex-snapshot
Graph Matching and Similarity
inferred← citeshttps://doi.org/10.1007/978-3-540-24672-5_31openalex-snapshot
An Information-Based Measure for Grouping Quality
inferred← citeshttps://doi.org/10.1007/978-3-540-30192-9_57openalex-snapshot
Diχeminator: A Profile-Based Selective Dissemination System for XML Documents
inferred← citeshttps://doi.org/10.1007/978-3-540-78849-2_24openalex-snapshot
Similarity Computation for XML Documents by XML Element Sequence Patterns
inferred← citeshttps://doi.org/10.1007/978-3-642-03348-3_71openalex-snapshot
Similarity Evaluation of XML Documents Based on Weighted Element Tree Model
inferred← citeshttps://doi.org/10.1007/978-3-642-20844-7_17openalex-snapshot
Exploration of the Labelling Space Given Graph Edit Distance Costs
inferred← citeshttps://doi.org/10.1007/bfb0033223openalex-snapshot
Error-tolerant graph matching: A formal framework and algorithms
inferred← citeshttps://doi.org/10.1007/s10115-007-0080-8openalex-snapshot
Fast and effective clustering of XML data using structural information
inferred← citeshttps://doi.org/10.1007/s10844-006-0023-yopenalex-snapshot
Measuring the structural similarity among XML documents and DTDs
inferred← citeshttps://doi.org/10.1016/j.cviu.2010.12.005openalex-snapshot
Graph attribute embedding via Riemannian submersion learning
inferred← citeshttps://doi.org/10.1016/j.knosys.2006.08.006openalex-snapshot
XML schema clustering with semantic and hierarchical similarity measures
inferred← citeshttps://doi.org/10.1016/j.patcog.2012.03.018openalex-snapshot
Geometric graph comparison from an alignment viewpoint
inferred← citeshttps://doi.org/10.1016/j.patcog.2019.01.043openalex-snapshot
Graph edit distance: Restrictions to be a metric
inferred← citeshttps://doi.org/10.1016/j.patrec.2011.08.012openalex-snapshot
Pattern analysis with graphs: Parallel work at Bern and York
inferred← citeshttps://doi.org/10.1016/s0167-8655(97)00060-3openalex-snapshot
On a relation between graph edit distance and maximum common subgraph
inferred← citeshttps://doi.org/10.1016/s0306-4379(03)00031-0openalex-snapshot
A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications
inferred← citeshttps://doi.org/10.1023/a:1010832230794openalex-snapshot
Language Simplification through Error-Correcting and Grammatical Inference Techniques
inferred← citeshttps://doi.org/10.1109/34.790431openalex-snapshot
Error correcting graph matching: on the influence of the underlying cost function
inferred← citeshttps://doi.org/10.1109/focs.2015.15openalex-snapshot
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping
inferred← citeshttps://doi.org/10.1109/icpr.2002.1047428openalex-snapshot
Fast cyclic edit distance computation with weighted edit costs in classification
inferred← citeshttps://doi.org/10.1109/is.2006.348394openalex-snapshot
Fast Kernel for Calculating Structural Information Similarities
inferred← citeshttps://doi.org/10.1109/mmdbms.1998.709503openalex-snapshot
A distance measure for video sequence similarity matching
inferred← citeshttps://doi.org/10.1109/spire.1999.796572openalex-snapshot
An efficient uniform-cost normalized edit distance algorithm
inferred← citeshttps://doi.org/10.1109/wi.2006.106openalex-snapshot
Investigating Semantic Measures in XML Clustering
inferred← citeshttps://doi.org/10.1142/5210openalex-snapshot
Data Mining in Time Series Databases
inferred← citeshttps://doi.org/10.1142/9789812565402_0004openalex-snapshot
INDEXING TIME-SERIES UNDER CONDITIONS OF NOISE
inferred← citeshttps://doi.org/10.1142/s0218001407005648openalex-snapshot
A PROGRESSIVE CLUSTERING ALGORITHM TO GROUP THE XML DATA BY STRUCTURAL AND SEMANTIC SIMILARITY
inferred← citeshttps://doi.org/10.1142/s021800141260004xopenalex-snapshot
ON THE GRAPH EDIT DISTANCE COST: PROPERTIES AND APPLICATIONS
inferred← citeshttps://doi.org/10.1142/s0219265902000562openalex-snapshot
DETECTION OF ABNORMAL CHANGE IN A TIME SERIES OF GRAPHS
inferred← citeshttps://doi.org/10.1145/2457317.2457384openalex-snapshot
Efficient high-similarity string comparison
inferred← citeshttps://doi.org/10.1145/2897937.2898079openalex-snapshot
Reducing serial I/O power in error-tolerant applications by efficient lossy encoding
inferred← citeshttps://doi.org/10.1561/1000000049openalex-snapshot
Error-Efficient Computing Systems
inferred← citeshttps://doi.org/10.22028/d291-25431openalex-snapshot
Tight(er) bounds for similarity measures, smoothed approximation and broadcasting
inferred← citeshttps://doi.org/10.4018/978-1-61350-356-0.ch005openalex-snapshot
Approximate Matching Between XML Documents and Schemas with Applications in XML Classification and Clustering
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.