Pages that link to "Item:Q5961623"
From MaRDI portal
The following pages link to On the complexity of comparing evolutionary trees (Q5961623):
Displayed 20 items.
- Breaks, cuts, and patterns (Q408430) (← links)
- New results for the longest haplotype reconstruction problem (Q423956) (← 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 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)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- Identifying approximately common substructures in trees based on a restricted edit distance (Q1971775) (← links)
- Bounding the number of hybridisation events for a consistent evolutionary history (Q2388380) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← 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)