Approximation and Special Cases of Common Subtrees and Editing Distance

@inproceedings{Halldrsson1996ApproximationAS,
  title={Approximation and Special Cases of Common Subtrees and Editing Distance},
  author={Magn{\'u}s M. Halld{\'o}rsson and Keisuke Tanaka},
  booktitle={ISAAC},
  year={1996}
}
Given two rooted, labeled, unordered trees, the common sub-tree problem is to nd a bijective matching between subsets of vertices of the trees of maximum cardinality which preserves labels and ancestry relationship. The tree editing distance problem is to determine the least cost sequence of additions, deletions and changes that converts a tree into another given tree. Both problems are known to be hard to approximate within some constant factor in general. We present polynomial algorithms for… CONTINUE READING

From This Paper

Topics from this paper.
11 Citations
4 References
Similar Papers

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Approximation algorithm for the maximum common hereditary subtree problem

  • A. Yamaguchi
  • Manuscript. (In Japanese),
  • 1994
Highly Influential
4 Excerpts

A compendium of NP optimization problems. Dy namic on-line survey available at ftp.nada.kth.se

  • P. Crescenzi, V. Kann
  • 1995
1 Excerpt

Similar Papers

Loading similar papers…