Fast algorithms for the unit cost editing distance between trees (Q5750416): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0196-6774(90)90011-3 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2035582095 / rank | |||
Normal rank | |||
Latest revision as of 18:06, 19 March 2024
scientific article; zbMATH DE number 4185051
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
