Algorithms for finding a most similar subforest (Q538470)
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 5899599
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for finding a most similar subforest |
scientific article; zbMATH DE number 5899599 |
Statements
Algorithms for finding a most similar subforest (English)
0 references
25 May 2011
0 references
approximate pattern matching
0 references
forest edit distance
0 references
simple substructure
0 references
sibling substructure
0 references
closed subforest
0 references
dynamic programming
0 references
0.9951379895210266
0 references
0.8968960046768188
0 references
0.8951126337051392
0 references
0.8945180773735046
0 references
0.8822749257087708
0 references
