Polynomial-time algorithms for the ordered maximum agreement subtree problem (Q5315329)
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 2203536
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomial-time algorithms for the ordered maximum agreement subtree problem |
scientific article; zbMATH DE number 2203536 |
Statements
Combinatorial Pattern Matching (English)
0 references
Polynomial-time algorithms for the ordered maximum agreement subtree problem (English)
0 references
7 September 2005
0 references
0.9982590079307556
0 references
0.997875988483429
0 references
0.8666862845420837
0 references
0.8319416046142578
0 references