Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees (Q1935809): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 16:38, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees |
scientific article |
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
