A constrained edit distance algorithm between semi-ordered trees (Q1006058)
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 5529510
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A constrained edit distance algorithm between semi-ordered trees |
scientific article; zbMATH DE number 5529510 |
Statements
A constrained edit distance algorithm between semi-ordered trees (English)
0 references
17 March 2009
0 references
semi-ordered trees
0 references
theory of computation
0 references
tree editing
0 references
dynamic programming
0 references
0.8550233840942383
0 references
0.8521267175674438
0 references
0.8429635763168335
0 references
0.8376861214637756
0 references
0.8340582251548767
0 references
