Tree edit distance from information theory

DOI10.1007/3-540-45028-9_7MaRDI QIDQ4450792zbMATH OpenFDO

Authors Andrea Torsello, Edwin R. Hancock

Publication date 16 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2726/27260071.htm

Mathematics Subject Classification ID

Data structures (68P05) Graph theory (including graph drawing) in computer science (68R10) Pattern recognition, speech recognition (68T10) Information theory (general) (94A15)

Recommendations

• Learning probabilistic models of tree edit distance
• Computing approximate tree edit distance using relaxation labeling
• Fast algorithms for the unit cost editing distance between trees
• Analysis of tree edit distance algorithms
• A survey on tree edit distance and related problems

Cited in

(2)

• Scale Space and PDE Methods in Computer Vision
• Learning probabilistic models of tree edit distance

This page was built for publication: Tree edit distance from information theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450792)