Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees (Q1935809)
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: Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees |
scientific article; zbMATH DE number 6137353
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees |
scientific article; zbMATH DE number 6137353 |
Statements
Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees (English)
0 references
19 February 2013
0 references
tree edit distance
0 references
approximation algorithms
0 references
parameterized algorithms
0 references
dynamic programming
0 references
unordered trees
0 references
0.941389501094818
0 references
0.8748659491539001
0 references
0.8716990351676941
0 references
0.8386548161506653
0 references
0.8382826447486877
0 references
