Efficient exponential-time algorithms for edit distance between unordered trees (Q2442818): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jda.2013.09.001 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2069551218 / rank | |||
Normal rank | |||
Revision as of 01:08, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient exponential-time algorithms for edit distance between unordered trees |
scientific article |
Statements
Efficient exponential-time algorithms for edit distance between unordered trees (English)
0 references
1 April 2014
0 references
edit distance
0 references
unordered tree
0 references
algorithm
0 references
bipartite matching
0 references
