Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818)
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 6276547
| 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 6276547 |
Statements
Efficient exponential-time algorithms for edit distance between unordered trees (English)
0 references
1 April 2014
0 references
edit distance
0 references
unordered tree
0 references
algorithm
0 references
bipartite matching
0 references
0 references
0 references
0.9991661
0 references
0.9567124
0 references
0.93890125
0 references
0.9352006
0 references
0.9328638
0 references
0.9266182
0 references
0.9237424
0 references
