| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437702 | Theoretical Computer Science | 2010 | 9 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
