Fast algorithms for the unit cost editing distance between trees (Q5750416)
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: Fast algorithms for the unit cost editing distance between trees |
scientific article; zbMATH DE number 4185051
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Fast algorithms for the unit cost editing distance between trees |
scientific article; zbMATH DE number 4185051 |
Statements
Fast algorithms for the unit cost editing distance between trees (English)
0 references
1990
0 references
distance between trees
0 references
dynamic programming
0 references
parallel algorithms
0 references
0.934316337108612
0 references
0.8658502697944641
0 references
0.8600815534591675
0 references
0.8580150604248047
0 references
0.8578518033027649
0 references
