A metric for rooted trees with unlabeled vertices based on nested parentheses (Q410711): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A relation between edit distance for ordered trees and edit distance for Euler strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient lower and upper bounds of the diagonal-flip distance between triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on tree edit distance and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restricted rotation distance between binary trees. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotation distance is fixed-parameter tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refined upper bounds for right-arm rotation distances / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding restricted rotation distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on some tree similarity measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the rotation distance between binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two shortest path metrics on well-formed parentheses strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotation sequences and edge-colouring of binary tree pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alignment of trees -- an alternative to tree edit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4218410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The longest common subsequence problem for sequences with nested arc annotations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Rotations and the Generation of Binary Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the upper bound on the rotation distance of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property testing of regular tree languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: A distance metric on binary trees using lattice-theoretic measures / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient upper bound of the rotation distance of binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rotation Distance, Triangulations, and Hyperbolic Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tree-to-Tree Correction Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Pattern Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding planar graphs in four pages / rank
 
Normal rank

Latest revision as of 01:46, 5 July 2024

scientific article
Language Label Description Also known as
English
A metric for rooted trees with unlabeled vertices based on nested parentheses
scientific article

    Statements

    A metric for rooted trees with unlabeled vertices based on nested parentheses (English)
    0 references
    0 references
    0 references
    3 April 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    tree metric
    0 references
    nested parenthesis strings
    0 references
    NP-completeness
    0 references
    approximation algorithm
    0 references
    0 references
    0 references
    0 references
    0 references