On the public citation graph
A Constrained Edit Distance Between Unordered Labeled Trees
0 signed · 189 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.1006/jagm.1994.1003openalex-snapshot
Approximate Tree Matching in the Presence of Variable Length Don′t Cares
inferredcites →https://doi.org/10.1007/bf02426925openalex-snapshot
Object representation and recognition using mathematical morphology model
inferredcites →https://doi.org/10.1016/0020-0190(92)90136-jopenalex-snapshot
On the editing distance between unordered labeled trees
inferredcites →https://doi.org/10.1016/0020-0190(94)90062-0openalex-snapshot
Some MAX SNP-hard results concerning unordered labeled trees
inferredcites →https://doi.org/10.1016/0031-3203(94)00109-yopenalex-snapshot
Algorithms for the constrained editing distance between ordered labeled trees and related problems
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/0196-6774(89)90010-2openalex-snapshot
Fast parallel and serial approximate string matching
inferredcites →https://doi.org/10.1093/bioinformatics/6.4.309openalex-snapshot
Comparing multiple RNA secondary structures using tree comparisons
inferredcites →https://doi.org/10.1109/34.23111openalex-snapshot
Threshold decomposition of gray-scale morphology into binary morphology
inferredcites →https://doi.org/10.1109/69.298173openalex-snapshot
A system for approximate tree matching
inferredcites →https://doi.org/10.1109/sfcs.1992.267823openalex-snapshot
Proof verification and hardness of approximation problems
inferredcites →https://doi.org/10.1137/0126070openalex-snapshot
On the Theory and Computation of Evolutionary Distances
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.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1142/s0218001488000157openalex-snapshot
THE TREE-TO-TREE EDITING PROBLEM
inferredcites →https://doi.org/10.1145/322139.322143openalex-snapshot
The Tree-to-Tree Correction Problem
inferredcites →https://doi.org/10.2116/analsci.3.23openalex-snapshot
Recognition of Largest Common Structural Fragment among a Variety of Chemical Structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/ima.20146openalex-snapshot
HMM‐based graph edit distance for image indexing
inferred← citeshttps://doi.org/10.1007/11560586_26openalex-snapshot
A Theoretical Analysis of Alignment and Edit Problems for Trees
inferred← citeshttps://doi.org/10.1007/11603047_22openalex-snapshot
Editing Distances Between Membrane Structures
inferred← citeshttps://doi.org/10.1007/11610113_29openalex-snapshot
Approximate Top-k Structural Similarity Search over XML Documents
inferred← citeshttps://doi.org/10.1007/3-540-44679-6_37openalex-snapshot
A New Measure of Edit Distance between Labeled Trees
inferred← citeshttps://doi.org/10.1007/3-540-44745-8_29openalex-snapshot
Efficiently Computing Weighted Tree Edit Distance Using Relaxation Labeling
inferred← citeshttps://doi.org/10.1007/3-540-47977-5_54openalex-snapshot
Matching and Embedding through Edit-Union of Trees
inferred← citeshttps://doi.org/10.1007/3-540-48035-8_50openalex-snapshot
Derivation of L-system Models from Measurements of Biological Branching Structures Using Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/3-540-68530-8_8openalex-snapshot
Computing the Edit-Distance Between Unrooted Ordered Trees
inferred← citeshttps://doi.org/10.1007/978-3-030-05499-1_4openalex-snapshot
Earth Mover’s Distance Between Rooted Labeled Unordered Trees Formulated from Complete Subtrees
inferred← citeshttps://doi.org/10.1007/978-3-030-58884-7_6openalex-snapshot
Caterpillar Alignment Distance for Rooted Labeled Caterpillars: Distance Based on Alignments Required to Be Caterpillars
inferred← citeshttps://doi.org/10.1007/978-3-030-89657-7_27openalex-snapshot
An A*-algorithm for the Unordered Tree Edit Distance with Custom Costs
inferred← citeshttps://doi.org/10.1007/978-3-031-43421-1_10openalex-snapshot
The Metric is the Message: Benchmarking Challenges for Neural Symbolic Regression
inferred← citeshttps://doi.org/10.1007/978-3-032-07021-0_6openalex-snapshot
Supporting Maintenance of Formal Mathematics with Similarity Search
inferred← citeshttps://doi.org/10.1007/978-3-319-10265-8_2openalex-snapshot
Centroid Clustering of Cellular Lineage Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-60134-2_11openalex-snapshot
Alignment Distance of Regular Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-319-75417-8_26openalex-snapshot
Path Histogram Distance for Rooted Labeled Caterpillars
inferred← citeshttps://doi.org/10.1007/978-3-540-24673-2_34openalex-snapshot
A Polynomial-Time Metric for Attributed Trees
inferred← citeshttps://doi.org/10.1007/978-3-540-24741-8_39openalex-snapshot
Efficient Similarity Search for Hierarchical Data in Large Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-27816-0_13openalex-snapshot
Hierarchical Analysis of Low-Contrast Temporal Images with Linear Scale Space
inferred← citeshttps://doi.org/10.1007/978-3-540-30480-7_29openalex-snapshot
Schema-Less, Semantics-Based Change Detection for XML Documents
inferred← citeshttps://doi.org/10.1007/978-3-540-31988-7_31openalex-snapshot
Tree-Based Tracking of Temporal Image
inferred← citeshttps://doi.org/10.1007/978-3-540-87877-3_22openalex-snapshot
Modeling and Querying E-Commerce Data in Hybrid Relational-XML DBMSs
inferred← citeshttps://doi.org/10.1007/978-3-540-89556-5_14openalex-snapshot
Models Management, Implementation and Integration
inferred← citeshttps://doi.org/10.1007/978-3-642-03784-9_2openalex-snapshot
Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-23038-7_28openalex-snapshot
Dynamic Programming Algorithms for Efficiently Computing Cosegmentations between Biological Images
inferred← citeshttps://doi.org/10.1007/978-3-642-32090-3_19openalex-snapshot
On Computing Tractable Variations of Unordered Tree Edit Distance with Network Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-33122-0_11openalex-snapshot
RNA Tree Comparisons via Unrooted Unordered Alignments
inferred← citeshttps://doi.org/10.1007/978-3-658-19567-0_8openalex-snapshot
A Concept for Quantitative Comparison of Mathematical and Natural Language and its possible Effect on Learning
inferred← citeshttps://doi.org/10.1007/978-3-662-48119-6_24openalex-snapshot
Mapping Kernels Between Rooted Labeled Trees Beyond Ordered Trees
inferred← citeshttps://doi.org/10.1007/bfb0033234openalex-snapshot
Genetic algorithms for structural editing
inferred← citeshttps://doi.org/10.1007/s00224-016-9705-1openalex-snapshot
Tai Mapping Hierarchy for Rooted Labeled Trees Through Common Subforest
inferred← citeshttps://doi.org/10.1007/s00453-002-1002-5openalex-snapshot
An Edit Distance between Quotiented Trees
inferred← citeshttps://doi.org/10.1007/s00791-020-00325-2openalex-snapshot
Automated methods for the comparison of natural languages
inferred← citeshttps://doi.org/10.1007/s10044-008-0141-yopenalex-snapshot
A survey of graph edit distance
inferred← citeshttps://doi.org/10.1007/s10044-021-00971-3openalex-snapshot
Customizable HMM-based measures to accurately compare tree sets
inferred← citeshttps://doi.org/10.1007/s10479-019-03505-7openalex-snapshot
Centroid based Tree-Structured Data Clustering Using Vertex/Edge Overlap and Graph Edit Distance
inferred← citeshttps://doi.org/10.1007/s10681-007-9430-6openalex-snapshot
Comparison of tree architecture using tree edit distances: application to 2-year-old apple hybrids
inferred← citeshttps://doi.org/10.1007/s12021-009-9051-4openalex-snapshot
The Tree-Edit-Distance, a Measure for Quantifying Neuronal Morphology
inferred← citeshttps://doi.org/10.1007/s12021-009-9053-2openalex-snapshot
On Comparing Neuronal Morphologies with the Constrained Tree-edit-distance
inferred← citeshttps://doi.org/10.1007/s12021-011-9117-yopenalex-snapshot
The DIADEM Metric: Comparing Multiple Reconstructions of the Same Neuron
inferred← citeshttps://doi.org/10.1007/s12021-014-9219-4openalex-snapshot
Structure-Based Neuron Retrieval Across Drosophila Brains
inferred← citeshttps://doi.org/10.1007/s12021-014-9255-0openalex-snapshot
From Curves to Trees: A Tree-like Shapes Distance Using the Elastic Shape Analysis Framework
inferred← citeshttps://doi.org/10.1016/0031-3203(94)00109-yopenalex-snapshot
Algorithms for the constrained editing distance between ordered labeled trees and related problems
inferred← citeshttps://doi.org/10.1016/j.compbiolchem.2018.03.014openalex-snapshot
An approach for N-linked glycan identification from MS/MS spectra by target-decoy strategy
inferred← citeshttps://doi.org/10.1016/j.cviu.2012.08.002openalex-snapshot
A distance measure between labeled combinatorial maps
inferred← citeshttps://doi.org/10.1016/j.dam.2023.07.028openalex-snapshot
Characterization of random walks on space of unordered trees using efficient metric simulation
inferred← citeshttps://doi.org/10.1016/j.infsof.2021.106754openalex-snapshot
Erratum: Leveraging Flexible Tree Matching to repair broken locators in web automation scripts
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.09.025openalex-snapshot
Improved approximation of the largest common subtree of two unordered trees of bounded height
inferred← citeshttps://doi.org/10.1016/j.is.2022.102126openalex-snapshot
SFTM: Fast matching of web pages using Similarity-based Flexible Tree Matching
inferred← citeshttps://doi.org/10.1016/j.jvcir.2013.08.010openalex-snapshot
Structured representations in a content based image retrieval context
inferred← citeshttps://doi.org/10.1016/j.neucom.2014.12.058openalex-snapshot
An error-tolerant approximate matching algorithm for labeled combinatorial maps
inferred← citeshttps://doi.org/10.1016/j.patcog.2003.07.009openalex-snapshot
Hierarchical image segmentation using a correspondence with a tree model
inferred← citeshttps://doi.org/10.1016/j.patcog.2008.03.025openalex-snapshot
Image categorization: Graph edit direction histogram
inferred← citeshttps://doi.org/10.1016/j.patcog.2010.09.010openalex-snapshot
Multi-label classification and extracting predicted class hierarchies
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.030openalex-snapshot
A survey on tree edit distance and related problems
inferred← citeshttps://doi.org/10.1016/j.tcs.2008.11.022openalex-snapshot
A constrained edit distance algorithm between semi-ordered trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.10.002openalex-snapshot
Exact algorithms for computing the tree edit distance between unordered trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2012.11.017openalex-snapshot
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.06.022openalex-snapshot
Alignment distance of regular tree languages
inferred← citeshttps://doi.org/10.1016/s0167-8655(02)00255-6openalex-snapshot
Computing approximate tree edit distance using relaxation labeling
inferred← citeshttps://doi.org/10.1016/s0196-6774(03)00079-8openalex-snapshot
Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
inferred← citeshttps://doi.org/10.1051/forest:2000134openalex-snapshot
A distance measure between plant architectures
inferred← citeshttps://doi.org/10.1080/24751839.2020.1718443openalex-snapshot
Path histogram distance and complete subtree histogram distance for rooted labelled caterpillars
inferred← citeshttps://doi.org/10.1089/10665270252935511openalex-snapshot
A General Edit Distance between RNA Structures
inferred← citeshttps://doi.org/10.1093/bioinformatics/btg305openalex-snapshot
Parametric alignment of ordered trees
inferred← citeshttps://doi.org/10.1093/bioinformatics/bts109openalex-snapshot
Mirroring co-evolving trees in the light of their topologies
inferred← citeshttps://doi.org/10.1093/bioinformatics/bts207openalex-snapshot
Fast alignment of fragmentation trees
inferred← citeshttps://doi.org/10.1093/sysbio/syac028openalex-snapshot
A Linear Time Solution to the Labeled Robinson–Foulds Distance Problem
inferred← citeshttps://doi.org/10.1101/2020.09.14.293522openalex-snapshot
A Linear Time Solution to the Labeled Robinson-Foulds Distance Problem
inferred← citeshttps://doi.org/10.1109/frse58934.2023.00019openalex-snapshot
An Evaluation Method of Scratch3.0 Works Based on JSON Documents
inferred← citeshttps://doi.org/10.1109/icassp.2013.6639288openalex-snapshot
Hierarchical discriminative model for spoken language understanding
inferred← citeshttps://doi.org/10.1109/icde.2004.1320066openalex-snapshot
Efficient similarity search in large databases of tree structured objects
inferred← citeshttps://doi.org/10.1109/icde.2009.103openalex-snapshot
Differencing Provenance in Scientific Workflows
inferred← citeshttps://doi.org/10.1109/iciap.1999.797761openalex-snapshot
Bayesian graph edit distance
inferred← citeshttps://doi.org/10.1109/iciap.2007.4362870openalex-snapshot
Matching Relational Structures using the Edge-Association Graph
inferred← citeshttps://doi.org/10.1109/iciap.2007.87openalex-snapshot
Matching Relational Structures using the Edge-Association Graph
inferred← citeshttps://doi.org/10.1109/icmlc.2004.1382372openalex-snapshot
The study of key techniques in intelligent XML search engine
inferred← citeshttps://doi.org/10.1109/ifsa-nafips.2013.6608505openalex-snapshot
A fuzzy tree similarity based recommendation approach for telecom products
inferred← citeshttps://doi.org/10.1109/iiai-aai.2012.74openalex-snapshot
An Isolated-Subtree Inclusion for Unordered Trees
inferred← citeshttps://doi.org/10.1109/iiai-aai53430.2021.00004openalex-snapshot
Leaf-Preserving Distance between Rooted Labeled Caterpillars
inferred← citeshttps://doi.org/10.1109/iiai-aai63651.2024.00023openalex-snapshot
Ancestral-Path Descendant-Labels Histogram Distance for Rooted Labeled Trees
inferred← citeshttps://doi.org/10.1109/ijcnn.2010.5596699openalex-snapshot
Multi-label classification by ART-based neural networks and hierarchy extraction
inferred← citeshttps://doi.org/10.1109/isbi.2006.1624864openalex-snapshot
Optimal Graph-Theoretic Approach to 3D Anatomical Tree Matching
inferred← citeshttps://doi.org/10.1109/percom.2008.34openalex-snapshot
Environment-Awareness: Quantitative Processing of Context Changes
inferred← citeshttps://doi.org/10.1109/policy.2011.13openalex-snapshot
Automatic Policy Rule Extraction for Configuration Management
inferred← citeshttps://doi.org/10.1109/smc.2013.594openalex-snapshot
A Fuzzy Tree Similarity Measure and Its Application in Telecom Product Recommendation
inferred← citeshttps://doi.org/10.1109/tcbb.2009.29openalex-snapshot
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
inferred← citeshttps://doi.org/10.1109/tcbb.2017.2701819openalex-snapshot
An Improved Approach for N-Linked Glycan Structure Identification from HCD MS/MS Spectra
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.1109/titb.2003.821318openalex-snapshot
String matching techniques for high-level primitive formation in 2-D vascular imaging
inferred← citeshttps://doi.org/10.1109/tkde.2015.2457922openalex-snapshot
Similar Subtree Search Using Extended Tree Inclusion
inferred← citeshttps://doi.org/10.1109/topoinvis57755.2022.00010openalex-snapshot
A Deformation-based Edit Distance for Merge Trees
inferred← citeshttps://doi.org/10.1109/topoinvis60193.2023.00015openalex-snapshot
Taming Horizontal Instability in Merge Trees: On the Computation of a Comprehensive Deformation-Based Edit Distance
inferred← citeshttps://doi.org/10.1109/topoinvis68599.2025.00005openalex-snapshot
A Comparative Study of Different Edit Distance-Based Methods for Feature Tracking using Merge Trees on Time-Varying Scalar Fields
inferred← citeshttps://doi.org/10.1109/tpami.2005.146openalex-snapshot
Polynomial-time metrics for attributed trees
inferred← citeshttps://doi.org/10.1109/tpami.2006.152openalex-snapshot
A binary linear programming formulation of the graph edit distance
inferred← citeshttps://doi.org/10.1109/tpds.2019.2892957openalex-snapshot
Data Prefetching and Eviction Mechanisms of In-Memory Storage Systems Based on Scheduling for Big Data Processing
inferred← citeshttps://doi.org/10.1109/tvcg.2016.2636187openalex-snapshot
Creative Virtual Tree Modeling Through Hierarchical Topology-Preserving Blending
inferred← citeshttps://doi.org/10.1109/tvcg.2018.2873612openalex-snapshot
Edit Distance between Merge Trees
inferred← citeshttps://doi.org/10.1109/tvcg.2021.3114839openalex-snapshot
Wasserstein Distances, Geodesics and Barycenters of Merge Trees
inferred← citeshttps://doi.org/10.1109/tvcg.2021.3122176openalex-snapshot
Comparative Analysis of Merge Trees Using Local Tree Edit Distance
inferred← citeshttps://doi.org/10.1109/tvcg.2022.3163349openalex-snapshot
Geometry-Aware Merge Tree Comparisons for Time-Varying Data With Interleaving Distances
inferred← citeshttps://doi.org/10.1109/tvcg.2022.3215001openalex-snapshot
Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams)
inferred← citeshttps://doi.org/10.1109/tvcg.2023.3334755openalex-snapshot
Wasserstein Auto-Encoders of Merge Trees (and Persistence Diagrams)
inferred← citeshttps://doi.org/10.1109/tvcg.2025.3567120openalex-snapshot
Accelerating Computation of Stable Merge Tree Edit Distances Using Parameterized Heuristics
inferred← citeshttps://doi.org/10.1109/wi-iat.2014.66openalex-snapshot
An Approach to Join Ontologies and Their Reuse in the Construction of Application Ontologies
inferred← citeshttps://doi.org/10.1111/cgf.12282openalex-snapshot
Inverse Procedural Modelling of Trees
inferred← citeshttps://doi.org/10.1111/cgf.13985openalex-snapshot
Fuzzy Contour Trees: Alignment and Joint Layout of Multiple Contour Trees
inferred← citeshttps://doi.org/10.1111/cgf.14331openalex-snapshot
Scalar Field Comparison with Topological Descriptors: Properties and Applications for Scientific Visualization
inferred← citeshttps://doi.org/10.1111/cgf.14547openalex-snapshot
Branch Decomposition‐Independent Edit Distances for Merge Trees
inferred← citeshttps://doi.org/10.1111/cgf.70449openalex-snapshot
Geometry‐Aware Alignment and Comparison of Hierarchical Morse Complexes with Applications
inferred← citeshttps://doi.org/10.1126/science.aar5663openalex-snapshot
Contact area–dependent cell communication and the morphological invariance of ascidian embryogenesis
inferred← citeshttps://doi.org/10.1137/1.9781611975499.4openalex-snapshot
Approximation of trees by self-nested trees
inferred← citeshttps://doi.org/10.1142/s0129054106004054openalex-snapshot
FAST ALGORITHMS FOR COMPARISON OF SIMILAR UNORDERED TREES
inferred← citeshttps://doi.org/10.1142/s0129054114500154openalex-snapshot
TRACTABLE AND INTRACTABLE VARIATIONS OF UNORDERED TREE EDIT DISTANCE
inferred← citeshttps://doi.org/10.1142/s0218348x05002805openalex-snapshot
TOWARD A QUANTIFICATION OF SELF-SIMILARITY IN PLANTS
inferred← citeshttps://doi.org/10.1145/1321440.1321500openalex-snapshot
Merging distributed database summaries
inferred← citeshttps://doi.org/10.1145/1376916.1376946openalex-snapshot
The power of two min-hashes for similarity search among hierarchical data objects
inferred← citeshttps://doi.org/10.1145/1520340.1520646openalex-snapshot
Automatic retargeting of web page content
inferred← citeshttps://doi.org/10.1145/3514221.3517850openalex-snapshot
JEDI: These aren't the JSON documents you're looking for...
inferred← citeshttps://doi.org/10.1145/3624918.3625337openalex-snapshot
Recommending Answers to Math Questions Based on KL-Divergence and Approximate XML Tree Matching
inferred← citeshttps://doi.org/10.1145/369133.369214openalex-snapshot
Edit distance between two RNA structures
inferred← citeshttps://doi.org/10.11606/d.55.2017.tde-13092017-143709openalex-snapshot
Recomendação de conteúdo baseada em informações semânticas extraídas de bases de conhecimento
inferred← citeshttps://doi.org/10.1177/0165551515602805openalex-snapshot
A stream-based method to detect differences between XML documents
inferred← citeshttps://doi.org/10.1186/1471-2105-12-s1-s13openalex-snapshot
A clique-based method for the edit distance between unordered trees and its application to analysis of glycan structures
inferred← citeshttps://doi.org/10.1186/1471-2105-13-s8-s7openalex-snapshot
NetMets: software for quantifying and visualizing errors in biological network segmentation
inferred← citeshttps://doi.org/10.1186/1748-7188-8-13openalex-snapshot
Unrooted unordered homeomorphic subtree alignment of RNA trees
inferred← citeshttps://doi.org/10.1186/s12859-015-0605-1openalex-snapshot
Topological characterization of neuronal arbor morphology via sequence representation: II - global alignment
inferred← citeshttps://doi.org/10.1186/s12864-020-07011-0openalex-snapshot
A generalized Robinson-Foulds distance for labeled trees
inferred← citeshttps://doi.org/10.1214/17-aoas1107openalex-snapshot
Statistical shape analysis of simplified neuronal trees
inferred← citeshttps://doi.org/10.15439/2017f73openalex-snapshot
Anchored Alignment Distance between Rooted Labeled Unordered Trees
inferred← citeshttps://doi.org/10.15439/2019f338openalex-snapshot
Alignment for Rooted Labeled Caterpillars
inferred← citeshttps://doi.org/10.15439/978-83-955416-1-2openalex-snapshot
Position Papers of the 2019 Federated Conference on Computer Science and Information Systems
inferred← citeshttps://doi.org/10.1609/aaai.v34i04.6033openalex-snapshot
Morphism-Based Learning for Structured Data
inferred← citeshttps://doi.org/10.18653/v1/2020.emnlp-main.125openalex-snapshot
Compositional Phrase Alignment and Beyond
inferred← citeshttps://doi.org/10.18653/v1/2023.starsem-1.39openalex-snapshot
Monolingual Phrase Alignment as Parse Forest Mapping
inferred← citeshttps://doi.org/10.23919/mva51890.2021.9511363openalex-snapshot
Shape-Based Floor Plan Retrieval Using Parse Tree Matching
inferred← citeshttps://doi.org/10.3233/fi-2014-1054openalex-snapshot
Segmental Mapping and Distance for Rooted Labeled Ordered Trees
inferred← citeshttps://doi.org/10.32657/10356/35749openalex-snapshot
Information concierge for the world wide web
inferred← citeshttps://doi.org/10.3390/a12090180openalex-snapshot
Nearest Embedded and Embedding Self-Nested Trees
inferred← citeshttps://doi.org/10.3390/electronics14020382openalex-snapshot
Mutation-Based Approach to Supporting Human–Machine Pair Inspection
inferred← citeshttps://doi.org/10.3390/make3010006openalex-snapshot
Learning DOM Trees of Web Pages by Subpath Kernel and Detecting Fake e-Commerce Sites
inferred← citeshttps://doi.org/10.3724/sp.j.1016.2008.01331openalex-snapshot
A Modified Operation Similarity Measure Method Based on WSDL Description
inferred← citeshttps://doi.org/10.3934/math.2025586openalex-snapshot
A graph-matching formulation of the interleaving distance between merge trees
inferred← citeshttps://doi.org/10.3934/math.2025769openalex-snapshot
A finitely stable edit distance for merge trees
inferred← citeshttps://doi.org/10.4018/978-1-60566-330-2.ch002openalex-snapshot
A Comparative Study of XML Change Detection Algorithms
inferred← citeshttps://doi.org/10.4018/ijarb.290341openalex-snapshot
Lossless Compression of Semi-Ordered Trees
inferred← citeshttps://doi.org/10.48550/arxiv.1110.5704openalex-snapshot
Mirroring co-evolving trees in the light of their topologies
inferred← citeshttps://doi.org/10.48550/arxiv.1111.6983openalex-snapshot
Aggregation of Composite Solutions: strategies, models, examples
inferred← citeshttps://doi.org/10.48550/arxiv.1810.10860openalex-snapshot
Approximation of trees by self-nested trees
inferred← citeshttps://doi.org/10.48550/arxiv.2004.12821openalex-snapshot
SFTM: Fast Comparison of Web Documents using Similarity-based Flexible Tree Matching
inferred← citeshttps://doi.org/10.48550/arxiv.2111.11759openalex-snapshot
ReGroup: Recursive Neural Networks for Hierarchical Grouping of Vector Graphic Primitives
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0604051openalex-snapshot
Structural Alignments of pseudo-knotted RNA-molecules in polynomial time
inferred← citeshttps://doi.org/10.5204/thesis.eprints.127157openalex-snapshot
Business Process Drift: Detection and Characterization
inferred← citeshttps://doi.org/10.5220/0003658102380243openalex-snapshot
A NEW FREQUENT SIMILAR TREE ALGORITHM MOTIVATED BY DOM MINING - Using RTDM and its New Variant — SiSTeR
inferred← citeshttps://doi.org/10.5282/edoc.2840openalex-snapshot
New Techniques for Clustering Complex Objects
inferred← citeshttps://doi.org/10.5715/jnlp.28.270openalex-snapshot
Seeking an Ideal Phrase Alignment Method
inferred← citeshttps://doi.org/10.70675/25248cddz689az4f98z8bd2z381c02a454c3openalex-snapshot
When operations research meets structural pattern recognition : on the solution of error-tolerant graph matching problems
inferred← citeshttps://doi.org/10.70675/4c5b9ac8za52az4f9ez93d2zc0ae80dfd3e3openalex-snapshot
Graph Mining and Graph Classification : application to cadastral map analysis
inferred← citeshttps://doi.org/10.70675/a524d1edzfba2z4444zb9a3z064d513a7d5copenalex-snapshot
Analyse de la morphologie axonale : du traitement des images à la modélisation
inferred← citeshttps://doi.org/10.70675/f6542660zfffez4af1z9b87zcdfcef120badopenalex-snapshot
Applications of digital topology for real-time markerless motion capture
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.