Pages that link to "Item:Q1074275"
From MaRDI portal
The following pages link to Optimal algorithms for comparing trees with labeled leaves (Q1074275):
Displayed 10 items.
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves (Q1091713) (← links)
- On the use of ordered sets in problems of comparison and consensus of classifications (Q1104668) (← links)
- N-trees as nestings: Complexity, similarity, and consensus (Q1104670) (← links)
- The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
- The agreement metric for labeled binary trees (Q1340485) (← links)
- Combining polynomial running time and fast convergence for the disk-covering method. (Q1872716) (← links)
- (Q2741329) (← links)
- SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES (Q4652795) (← links)
- The asymmetric median tree. --- A new model for building consensus trees (Q5961632) (← links)