Approximation and parameterized algorithms for common subtrees and edit distance between unordered trees (Q1935809): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2012.11.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2146138435 / rank | |||
Normal rank | |||
Latest revision as of 23:01, 19 March 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
