Improved methods for computing distances between unordered trees using integer programming (Q1708596)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved methods for computing distances between unordered trees using integer programming |
scientific article; zbMATH DE number 6852635
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Improved methods for computing distances between unordered trees using integer programming |
scientific article; zbMATH DE number 6852635 |
Statements
Improved methods for computing distances between unordered trees using integer programming (English)
0 references
26 March 2018
0 references
tree edit distance
0 references
unorderd trees
0 references
integer programming
0 references
dynamic programming
0 references
0.8066831231117249
0 references
0.8041692972183228
0 references
0.801069974899292
0 references
0.7997792959213257
0 references
