Highly Influenced

# 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} }

- Published 1996 in ISAAC
DOI:10.1007/BFb0009483

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

#### References

##### Publications referenced by this paper.

Showing 1-4 of 4 references

Highly Influential

Highly Influential