Pages that link to "Item:Q2746434"
From MaRDI portal
The following pages link to An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings (Q2746434):
Displayed 13 items.
- Tree edit distance and maximum agreement subtree (Q458389) (← links)
- Improved algorithms for maximum agreement and compatible supertrees (Q627540) (← links)
- Comparing and aggregating partially resolved trees (Q650896) (← links)
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850) (← links)
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation (Q990618) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- Unranked second-order anti-unification (Q2401634) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- From constrained to unconstrained maximum agreement subtree in linear time (Q2479535) (← links)
- Faster Algorithms for Semi-Matching Problems (Q2799478) (← links)
- Largest Weight Common Subtree Embeddings with Distance Penalties (Q5005156) (← links)