Pages that link to "Item:Q1198043"

The following pages link to On the editing distance between unordered labeled trees (Q1198043):

Displaying 35 items.

• A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711) (← links)
• Tree edit distance and maximum agreement subtree (Q458389) (← links)
• A survey on tree edit distance and related problems (Q557823) (← links)
• Exact algorithms for computing the tree edit distance between unordered trees (Q620949) (← links)
• Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
• Alignment of trees -- an alternative to tree edit (Q673642) (← links)
• A relation between edit distance for ordered trees and edit distance for Euler strings (Q845840) (← links)
• A similarity measure for graphs with low computational complexity (Q861127) (← links)
• Graph embedding using tree edit-union (Q869016) (← links)
• Improved approximation of the largest common subtree of two unordered trees of bounded height (Q975557) (← links)
• On the editing distance between unordered labeled trees (Q1198043) (← links)
• Some MAX SNP-hard results concerning unordered labeled trees (Q1318750) (← links)
• Algorithms for approximate graph matching (Q1357079) (← links)
• Treelet kernel incorporating cyclic, stereo and inter pattern information in chemoinformatics (Q1677061) (← links)
• Tree edit distance with gaps (Q1853686) (← links)
• A constrained edit distance between unordered labeled trees (Q1908261) (← links)
• New and improved algorithms for unordered tree inclusion (Q2049980) (← links)
• On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← links)
• Covering tree with stars (Q2354301) (← links)
• Comparing large graphs efficiently by margins of feature vectors (Q2372051) (← links)
• Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818) (← links)
• Inexact tree pattern matching with 1-degree edit distance using finite automata (Q2689648) (← links)
• Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees (Q2904510) (← links)
• Tractable and intractable variations of unordered tree edit distance (Q2929619) (← links)
• New dissimilarity measure for recognizing noisy subsequence trees (Q2997938) (← links)
• Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees (Q3011871) (← links)
• Edit distance between unlabeled ordered trees (Q3423140) (← links)
• ON THE EDITING DISTANCE BETWEEN UNDIRECTED ACYCLIC GRAPHS (Q4888367) (← links)
• (Q5091018) (← links)
• Alignment distance of regular tree languages (Q5919581) (← links)
• Alignment distance of regular tree languages (Q5920054) (← links)
• Characterization of random walks on space of unordered trees using efficient metric simulation (Q6069174) (← links)
• Automated methods for the comparison of natural languages (Q6163813) (← links)
• Anti Tai mapping for unordered labeled trees (Q6195334) (← links)
• Approximation and special cases of common subtrees and editing distance (Q6487427) (← links)