Edit distance between unlabelled ordered trees (Q3154686)
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 2127737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Edit distance between unlabelled ordered trees |
scientific article; zbMATH DE number 2127737 |
Statements
14 January 2005
0 references
sorted permutation
0 references
0.8601132035255432
0 references
0.7813863754272461
0 references
0.7521199584007263
0 references
0.7429245710372925
0 references
0.7372671365737915
0 references
Edit distance between unlabelled ordered trees (English)
0 references
For a natural number \(n\), a sorted permutation of \(\{1,\dots, n\}\) is a permutation \(\sigma\) such that \(\sigma = InJ\) where \(I\) and \(J\) are sorted permutations on \(\{1,\dots,p\}\) and \(\{p+1,\dots,n-1\}\), for some \(0\leq p \leq n-1\). In the paper, it is shown that the sorted permutations of \(n\) elements are in one-to-one correspondence with the rooted ordered trees of order \(n\). For the entire collection see [Zbl 1047.68003].
0 references
