Tree Edit Distance, Alignment Distance and Inclusion

  • Philip Bille

Research output: Book / Anthology / ReportReportResearch

Abstract

Wesurveytheproblemofcomparinglabeledtrees basedonsimplelocaloperationsofdeleting, 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.
Original languageEnglish
Place of PublicationCopenhagen
PublisherIT-Universitetet i København
EditionTR-2003-23
Number of pages24
ISBN (Electronic)87-7949-032-8
Publication statusPublished - Mar 2003
Externally publishedYes
SeriesIT University Technical Report Series
NumberTR-2003-23
ISSN1600-6100

Keywords

  • Tree Edit Distance
  • Labeled Trees
  • Local Operations
  • Algorithmic Solutions
  • Information Science

Fingerprint

Dive into the research topics of 'Tree Edit Distance, Alignment Distance and Inclusion'. Together they form a unique fingerprint.

Cite this