editsurvey.dvi
A Survey on Tree Edit Distance and Related Problems Philip Bille∗ The IT University of Copenhagen Glentevej 67, DK-2400 Copenhagen NV, Denmark. Email: beetle@itu.dk. Abstract We survey the problem of comparing labeled trees based on simple local operations of deleting, inserting, and relabeling nodes. These op- erations lead to the tree edit distance, alignment distance, and inclusion problem. For
1
ランã‚ング
ãŠçŸ¥ã‚‰ã›
ランã‚ング
リリースã€éšœå®³æƒ…å ±ãªã©ã®ã‚µãƒ¼ãƒ“スã®ãŠçŸ¥ã‚‰ã›
最新ã®äººæ°—エントリーã®é…ä¿¡
処ç†ã‚’実行ä¸ã§ã™
j次ã®ãƒ–ックマーク
kå‰ã®ãƒ–ックマーク
lã‚ã¨ã§èªã‚€
eコメント一覧を開ã
oページを開ã
http://www-kasm.nii.ac.jp/jsai2004_schedule/pdf/000147.pdf
http://www.cs.ucr.edu/~stelo/cpm/cpm03/Touzet.pdf
Resources for computing Tree-Edit Distance
{{#tags}}- {{label}}
{{/tags}}