Pages that link to "Item:Q2862198"
From MaRDI portal
The following pages link to Fixed-parameter algorithms for maximum agreement forests (Q2862198):
Displaying 36 items.
- rSPR (Q24975) (← links)
- On the maximum parsimony distance between phylogenetic trees (Q259724) (← links)
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees (Q270010) (← links)
- Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644) (← links)
- Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees (Q328699) (← links)
- Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies (Q383123) (← links)
- Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable (Q476442) (← links)
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees (Q476897) (← links)
- On the fixed parameter tractability of agreement-based phylogenetic distances (Q504072) (← links)
- Approximating maximum agreement forest on multiple binary trees (Q727962) (← links)
- Algorithms for parameterized maximum agreement forest problem on multiple trees (Q744101) (← links)
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
- Ricci-Ollivier curvature of the rooted phylogenetic subtree-prune-regraft graph (Q1675925) (← links)
- Deciding the existence of a cherry-picking sequence is hard on two trees (Q1741507) (← links)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees (Q2118383) (← links)
- New reduction rules for the tree bisection and reconnection distance (Q2210581) (← links)
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
- Not all phylogenetic networks are leaf-reconstructible (Q2330626) (← links)
- Reconciliation of a gene network and species tree (Q2415826) (← links)
- A quadratic kernel for computing the hybridization number of multiple trees (Q2450929) (← links)
- A faster FPT algorithm for the maximum agreement forest problem (Q2464325) (← links)
- Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance (Q2680228) (← links)
- A duality based 2-approximation algorithm for maximum agreement forest (Q2687064) (← links)
- Hybridization number on three rooted binary trees is EPT (Q2818206) (← links)
- Scanning Phylogenetic Networks Is NP-hard (Q3297781) (← links)
- The agreement distance of unrooted phylogenetic networks (Q3386619) (← links)
- Combining Networks Using Cherry Picking Sequences (Q5041128) (← links)
- Better Practical Algorithms for rSPR Distance and Hybridization Number (Q5091731) (← links)
- Computing Maximum Agreement Forests without Cluster Partitioning is Folly (Q5111745) (← links)
- A Tight Kernel for Computing the Tree Bisection and Reconnection Distance between Two Phylogenetic Trees (Q5233752) (← links)
- Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q5252691) (← links)
- Convex Characters, Algorithms, and Matchings (Q6141866) (← links)
- Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics (Q6152184) (← links)
- Ranked subtree prune and regraft (Q6194022) (← links)
