Efficient exponential time algorithms for edit distance between unordered trees (Q2904510)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6065616
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient exponential time algorithms for edit distance between unordered trees |
scientific article; zbMATH DE number 6065616 |
Statements
Efficient Exponential Time Algorithms for Edit Distance between Unordered Trees (English)
0 references
14 August 2012
0 references
tree edit distance
0 references
unordered trees
0 references
dynamic programming
0 references
maximum weight bipartite matching
0 references
0.981080174446106
0 references
0.8999338150024414
0 references
0.8607443571090698
0 references
0.8601229190826416
0 references
0.860058069229126
0 references
