A survey on tree edit distance and related problems

Philip Bille
<span title="">2005</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/elaf5sq7lfdxfdejhkqbtz6qoq" style="color: black;">Theoretical Computer Science</a> </i> &nbsp;
We survey the problem of comparing labeled trees based on simple local operations of deleting, inserting, and relabeling nodes. These operations lead to the tree edit distance, alignment distance, and inclusion problem. For each problem we review the results available and present, in detail, one or more of the central algorithms for solving the problem.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2004.12.030">doi:10.1016/j.tcs.2004.12.030</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ifuv2vs34vg63f4y3x2og6ok7y">fatcat:ifuv2vs34vg63f4y3x2og6ok7y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808194849/http://www2.compute.dtu.dk/~phbi/files/publications/2005asotedarpJ.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/53/1c/531c174de0474a8309a9b3be36b3ec04b011e0ab.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.tcs.2004.12.030"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>