On the public citation graph

A Multidimensional Sequence Approach to Measuring Tree Similarity

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/jagm.2001.1170openalex-snapshot
New Algorithm for Ordered Tree-to-Tree Correction Problem
inferredcites →https://doi.org/10.1007/11871842_32openalex-snapshot
Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees
inferredcites →https://doi.org/10.1007/3-540-68530-8_8openalex-snapshot
Computing the Edit-Distance Between Unrooted Ordered Trees
inferredcites →https://doi.org/10.1007/978-3-540-30219-3_35openalex-snapshot
Novel Tree Edit Operations for RNA Secondary Structure Comparison
inferredcites →https://doi.org/10.1007/s00453-008-9213-zopenalex-snapshot
Approximating Tree Edit Distance through String Edit Distance
inferredcites →https://doi.org/10.1007/s10559-008-0012-yopenalex-snapshot
On the time series support vector machine using dynamic time warping kernel for brain activity classification
inferredcites →https://doi.org/10.1016/0020-0190(77)90064-3openalex-snapshot
The tree-to-tree editing problem
inferredcites →https://doi.org/10.1016/b978-155860869-6/50043-3openalex-snapshot
Exact Indexing of Dynamic Time Warping
inferredcites →https://doi.org/10.1016/j.is.2004.11.009openalex-snapshot
A methodology for clustering XML documents by structure
inferredcites →https://doi.org/10.1016/j.jda.2006.07.002openalex-snapshot
Comparing similar ordered trees in linear-time
inferredcites →https://doi.org/10.1016/j.patcog.2006.04.012openalex-snapshot
Edit distance-based kernel functions for structural pattern classification
inferredcites →https://doi.org/10.1016/j.patcog.2008.11.030openalex-snapshot
Faster retrieval with a two-pass dynamic-time-warping lower bound
inferredcites →https://doi.org/10.1016/j.tcs.2004.12.030openalex-snapshot
A survey on tree edit distance and related problems
inferredcites →https://doi.org/10.1016/j.tcs.2008.08.035openalex-snapshot
Algorithms for subsequence combinatorics
inferredcites →https://doi.org/10.1109/ijcnn.2008.4634188openalex-snapshot
Support vector machines and dynamic time warping for time series
inferredcites →https://doi.org/10.1109/iwfhr.2002.1030883openalex-snapshot
Online handwriting recognition with support vector machines - a kernel approach
inferredcites →https://doi.org/10.1109/sitis.2007.112openalex-snapshot
A Study on the Dynamic Time Warping in Kernel Machines
inferredcites →https://doi.org/10.1109/tassp.1978.1163055openalex-snapshot
Dynamic programming algorithm optimization for spoken word recognition
inferredcites →https://doi.org/10.1137/0218082openalex-snapshot
Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
inferredcites →https://doi.org/10.1145/1061318.1061326openalex-snapshot
XML stream processing using tree-edit distance embeddings
inferredcites →https://doi.org/10.1145/1066157.1066243openalex-snapshot
Similarity evaluation on tree-structured data
inferredcites →https://doi.org/10.1145/1450295.1450298openalex-snapshot
Using a Hybrid Convolution Tree Kernel for Semantic Role Labeling
inferredcites →https://doi.org/10.1145/1553374.1553377openalex-snapshot
Route kernels for trees
inferredcites →https://doi.org/10.1145/1644015.1644017openalex-snapshot
An optimal decomposition algorithm for tree edit distance
inferredcites →https://doi.org/10.1145/276304.276319openalex-snapshot
Optimal multi-step k-nearest neighbor search
inferredcites →https://doi.org/10.1145/276305.276319openalex-snapshot
Optimal multi-step k-nearest neighbor search
inferredcites →https://doi.org/10.1145/322139.322143openalex-snapshot
The Tree-to-Tree Correction Problem
inferredcites →https://doi.org/10.1145/360825.360861openalex-snapshot
A linear space algorithm for computing maximal common subsequences
inferredcites →https://doi.org/10.1145/564691.564725openalex-snapshot
Approximate XML joins
inferredcites →https://doi.org/10.1145/860435.860443openalex-snapshot
Question classification using support vector machines
inferredcites →https://doi.org/10.1145/959242.959248openalex-snapshot
A survey of kernels for structured data
inferredcites →https://doi.org/10.1162/coli.2008.34.2.193openalex-snapshot
Tree Kernels for Semantic Role Labeling
inferredcites →https://doi.org/10.1527/tjsai.22.140openalex-snapshot
A Spectrum Tree Kernel
inferredcites →https://doi.org/10.2116/analsci.3.23openalex-snapshot
Recognition of Largest Common Structural Fragment among a Variety of Chemical Structures
inferredcites →https://doi.org/10.5167/uzh-56101openalex-snapshot
Approximate matching of hierarchical data using pq-grams
inferredcites →https://doi.org/10.7551/mitpress/1120.003.0085openalex-snapshot
Convolution Kernels for Natural Language

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-42297-8_36openalex-snapshot
Tree Similarity Measurement for Classifying Questions by Syntactic Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-29216-3_2openalex-snapshot
Financial Sequences and the Hidden Markov Model
inferred← citeshttps://doi.org/10.1007/s11760-022-02166-7openalex-snapshot
Structure-Preserving Hashing for Tree-Structured Data
inferred← citeshttps://doi.org/10.1016/j.eswa.2014.02.041openalex-snapshot
Data-mining based SQL injection attack detection using internal query trees
inferred← citeshttps://doi.org/10.1109/access.2019.2951637openalex-snapshot
User Interface Code Retrieval: A Novel Visual-Representation-Aware Approach
inferred← citeshttps://doi.org/10.1109/bibm.2015.7359657openalex-snapshot
A new algorithm for “the LCS problem” with application in compressing genome resequencing data
inferred← citeshttps://doi.org/10.1109/coase.2015.7294100openalex-snapshot
Visual impression localization of autonomous robots
inferred← citeshttps://doi.org/10.1109/icebe.2015.38openalex-snapshot
A novel method to measure graph similarity
inferred← citeshttps://doi.org/10.1109/tfuzz.2014.2315655openalex-snapshot
A Fuzzy Preference Tree-Based Recommender System for Personalized Business-to-Business E-Services
inferred← citeshttps://doi.org/10.1145/3365376openalex-snapshot
A Pure Visual Approach for Automatically Extracting and Aligning Structured Web Data
inferred← citeshttps://doi.org/10.1155/2020/8835310openalex-snapshot
Flowchart-Based Cross-Language Source Code Similarity Detection
inferred← citeshttps://doi.org/10.1186/s12864-016-2793-0openalex-snapshot
A new algorithm for “the LCS problem” with application in compressing genome resequencing data
inferred← citeshttps://doi.org/10.1371/journal.pone.0155739openalex-snapshot
Collaborative Filtering Recommendation on Users’ Interest Sequences
inferred← citeshttps://doi.org/10.3233/fi-2013-907openalex-snapshot
Lattice Machine Classification based on Contextual Probability
inferred← citeshttps://doi.org/10.33915/etd.5031openalex-snapshot
The Longest Common Subsequence via Generalized Suffix Trees
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.