Pages that link to "Item:Q1764471"

The following pages link to On the computational complexity of the rooted subtree prune and regraft distance (Q1764471):

Displaying 50 items.

• Computing nearest neighbour interchange distances between ranked phylogenetic trees (Q96718) (← links)
• Discrete coalescent trees (Q96722) (← 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)
• Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees (Q328699) (← 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)
• A cluster reduction for computing the subtree distance between phylogenies (Q659644) (← links)
• A scalable parallelization of the gene duplication problem (Q666045) (← links)
• Approximating maximum agreement forest on multiple binary trees (Q727962) (← links)
• Algorithms for parameterized maximum agreement forest problem on multiple trees (Q744101) (← links)
• Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571) (← links)
• An analytical upper bound on the minimum number of recombinations in the history of SNP sequences in populations (Q987779) (← links)
• Rotation distance is fixed-parameter tractable (Q989526) (← links)
• A 3-approximation algorithm for the subtree distance between phylogenies (Q1018098) (← links)
• Note on the hybridization number and subtree distance in phylogenetics (Q1021896) (← links)
• A new recombination lower bound and the minimum perfect phylogenetic forest problem (Q1029702) (← 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)
• On the complexity of computing MP distance between binary phylogenetic trees (Q1682616) (← links)
• On the subnet prune and regraft distance (Q1740360) (← links)
• Exploring the tiers of rooted phylogenetic network space using tail moves (Q1786929) (← links)
• Walks in phylogenetic treespace (Q1944961) (← links)
• Overlaid species forests (Q2065769) (← links)
• Properties for the Fréchet mean in Billera-Holmes-Vogtmann treespace (Q2197908) (← links)
• Faster exact computation of rSPR distance (Q2343983) (← links)
• A parsimony-based metric for phylogenetic trees (Q2348152) (← links)
• Approximating geodesic tree distance (Q2379945) (← links)
• Bounding the number of hybridisation events for a consistent evolutionary history (Q2388380) (← links)
• Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks (Q2404037) (← links)
• Extremal distances for subtree transfer operations in binary trees (Q2421307) (← links)
• Gene tree reconciliation including transfers with replacement is NP-hard and FPT (Q2424823) (← links)
• A quadratic kernel for computing the hybridization number of multiple trees (Q2450929) (← links)
• Spaces of phylogenetic networks from generalized nearest-neighbor interchange operations (Q2634749) (← 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)
• An Improved Approximation Algorithm for rSPR Distance (Q2817889) (← links)
• The agreement distance of unrooted phylogenetic networks (Q3386619) (← links)
• Haplotype Inferring Via Galled-Tree Networks Is NP-Complete (Q3511338) (← links)
• Efficiently Calculating Evolutionary Tree Measures Using SAT (Q3637154) (← links)
• Heading in the right direction? Using head moves to traverse phylogenetic network space (Q4994346) (← links)
• Distance metrics for ranked evolutionary trees (Q5073196) (← links)
• (Q5088919) (← 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)
• A New Algorithm for Inferring Hybridization Events Based on the Detection of Horizontal Gene Transfers (Q5270629) (← links)
• On a matching distance between rooted phylogenetic trees (Q5396440) (← links)
• Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks (Q6056548) (← links)
• Exploring spaces of semi-directed level-1 networks (Q6057997) (← links)