Pages that link to "Item:Q1313765"
From MaRDI portal
The following pages link to Kaikoura tree theorems: Computing the maximum agreement subtree (Q1313765):
Displaying 22 items.
- TreeOfTrees method to evaluate the congruence between gene trees (Q263301) (← links)
- Improved algorithms for maximum agreement and compatible supertrees (Q627540) (← links)
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850) (← links)
- Approximate labelled subtree homeomorphism (Q1018101) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- An improved bound on the maximum agreement subtree problem (Q1036838) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- The agreement metric for labeled binary trees (Q1340485) (← links)
- On the agreement of many trees (Q1352115) (← links)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- Finding a maximum compatible tree is NP-hard for sequences and trees (Q1921170) (← links)
- Novel phylogenetic network distances based on cherry picking (Q2061999) (← links)
- On the extremal maximum agreement subtree problem (Q2197478) (← links)
- Generalized LCS (Q2378524) (← links)
- On the ancestral compatibility of two phylogenetic trees with nested taxa (Q2433022) (← links)
- The maximum agreement subtree problem (Q2446824) (← links)
- From constrained to unconstrained maximum agreement subtree in linear time (Q2479535) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
- A duality based 2-approximation algorithm for maximum agreement forest (Q2687064) (← links)
- Bounds on the Expected Size of the Maximum Agreement Subtree (Q3449864) (← links)
- Analysis of the Period Recovery Error Bound (Q5874467) (← links)
- Maximum agreement subtrees and Hölder homeomorphisms between Brownian trees (Q6122622) (← links)
