Algorithms and Computation

Volume 4288 of the series Lecture Notes in Computer Science pp 90-99

Approximating Tree Edit Distance Through String Edit Distance

  • Tatsuya AkutsuAffiliated withBioinformatics Center, Institute for Chemical Research, Kyoto University
  • , Daiji FukagawaAffiliated withNational Institute of Informatics
  • , Atsuhiro TakasuAffiliated withNational Institute of Informatics

* Final gross prices may vary according to local VAT.

Get Access


This paper presents an O(n 2) time algorithm for approximating the unit cost edit distance for ordered and rooted trees of bounded degree within a factor of O(n 3/4), where n is the maximum size of two input trees, and the algorithm is based on transformation of an ordered and rooted tree into a string.