Tree Edit Distance, Alignment Distance and Inclusion

Philip Bille

Tree Edit Distance, Alignment Distance and Inclusion

Philip Bille

Research output: Book / Anthology / Report › Report › Research

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 language	English

Place of Publication	Copenhagen
Publisher	IT-Universitetet i København
Edition	TR-2003-23
Number of pages	24
ISBN (Electronic)	87-7949-032-8
Publication status	Published - Mar 2003
Externally published	Yes

Series	IT University Technical Report Series
Number	TR-2003-23
ISSN	1600-6100

Access to Document

ITU-TR-2003-23 pdfFinal published version, 229 KB

Cite this

@book{802b7326f2e84d4e8032199130f40f68,

title = "Tree Edit Distance, Alignment Distance and Inclusion",

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.",

author = "Philip Bille",

year = "2003",

month = mar,

language = "English",

series = "IT University Technical Report Series",

number = "TR-2003-23",

publisher = "IT-Universitetet i K{\o}benhavn",

address = "Denmark",

edition = "TR-2003-23",

}

TY - RPRT

T1 - Tree Edit Distance, Alignment Distance and Inclusion

AU - Bille, Philip

PY - 2003/3

Y1 - 2003/3

N2 - 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.

AB - 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.

M3 - Report

T3 - IT University Technical Report Series

BT - Tree Edit Distance, Alignment Distance and Inclusion

PB - IT-Universitetet i København

CY - Copenhagen

ER -

Tree Edit Distance, Alignment Distance and Inclusion

Abstract

Access to Document

Fingerprint

Cite this