Pages that link to "Item:Q5961623"
From MaRDI portal
The following pages link to On the complexity of comparing evolutionary trees (Q5961623):
Displaying 46 items.
- Computing nearest neighbour interchange distances between ranked phylogenetic trees (Q96718) (← 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)
- Breaks, cuts, and patterns (Q408430) (← links)
- New results for the longest haplotype reconstruction problem (Q423956) (← 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)
- Complexity issues in vertex-colored graph pattern matching (Q533412) (← links)
- Analyzing and reconstructing reticulation networks under timing constraints (Q604547) (← links)
- Improved algorithms for maximum agreement and compatible supertrees (Q627540) (← links)
- Approximating maximum agreement forest on multiple binary trees (Q727962) (← links)
- Algorithms for parameterized maximum agreement forest problem on multiple trees (Q744101) (← links)
- Approximating the maximum agreement forest on \(k\) trees (Q835040) (← links)
- Computing the minimum number of hybridization events for a consistent evolutionary history (Q881571) (← links)
- A 3-approximation algorithm for the subtree distance between phylogenies (Q1018098) (← links)
- The maximum agreement forest problem: Approximation algorithms and computational experiments (Q1022593) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- Fixed topology alignment with recombination (Q1585336) (← links)
- Computing similarity between RNA structures (Q1605306) (← links)
- A social choice approach to ordinal group activity selection (Q1642162) (← links)
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
- Stable and Pareto optimal group activity selection from ordinal preferences (Q1757088) (← links)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- Identifying approximately common substructures in trees based on a restricted edit distance (Q1971775) (← links)
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- New reduction rules for the tree bisection and reconnection distance (Q2210581) (← links)
- Faster exact computation of rSPR distance (Q2343983) (← links)
- Bounding the number of hybridisation events for a consistent evolutionary history (Q2388380) (← 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)
- Maximum agreement and compatible supertrees (Q2466022) (← 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)
- Maximum Motif Problem in Vertex-Colored Graphs (Q3637115) (← links)
- Efficiently Calculating Evolutionary Tree Measures Using SAT (Q3637154) (← links)
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
- SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES (Q4652795) (← links)
- Better Practical Algorithms for rSPR Distance and Hybridization Number (Q5091731) (← 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)
- Computing the rooted triplet distance between phylogenetic networks (Q5918288) (← links)
- Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks (Q6056548) (← links)
- Exploring spaces of semi-directed level-1 networks (Q6057997) (← links)
- Convex Characters, Algorithms, and Matchings (Q6141866) (← links)
- Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics (Q6152184) (← links)
