On the rotation distance in the lattice of binary trees
Information Processing Letters
On the rotation distance of binary trees
Information Processing Letters
Embedding planar graphs in four pages
Journal of Computer and System Sciences - 18th Annual ACM Symposium on Theory of Computing (STOC), May 28-30, 1986
On the upper bound on the rotation distance of binary trees
Information Processing Letters
A distance metric on binary trees using lattice-theoretic measures
Information Processing Letters
On rotations and the generation of binary trees
Journal of Algorithms
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Alignment of trees: an alternative to tree edit
Theoretical Computer Science
Two shortest path metrics on well-formed parentheses strings
Information Processing Letters
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The longest common subsequence problem for sequences with nested arc annotations
Journal of Computer and System Sciences - Computational biology 2002
Restricted rotation distance between binary trees
Information Processing Letters
Better Approximation of Diagonal-Flip Transformation and Rotation Transformation
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Some simplified NP-complete problems
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
Bounding restricted rotation distance
Information Processing Letters
Rotation sequences and edge-colouring of binary tree pairs
Theoretical Computer Science
A survey on tree edit distance and related problems
Theoretical Computer Science
The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation (Art of Computer Programming)
Theoretical Computer Science
A relation between edit distance for ordered trees and edit distance for Euler strings
Information Processing Letters
Efficient lower and upper bounds of the diagonal-flip distance between triangulations
Information Processing Letters
Note: Refined upper bounds for right-arm rotation distances
Theoretical Computer Science
Property Testing of Regular Tree Languages
Algorithmica
Rotation distance is fixed-parameter tractable
Information Processing Letters
A Practical Edit-Distance Model for RNA Secondary-Structure Comparison
BIBE '09 Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering
A linear tree edit distance algorithm for similar ordered trees
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
k-Restricted rotation with an application to search tree rebalancing
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
| Hi-index | 5.23 |
In this paper, we propose a new metric for rooted trees with unlabeled vertices based on alignments of nested parenthesis strings. We prove that the time complexity for computing this metric is NP-hard and present a 1.5-approximation algorithm for it.