On the complexity of comparing evolutionary trees
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1003279 (Why is no real title available?)
- scientific article; zbMATH DE number 1003280 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1256636 (Why is no real title available?)
- A mathematical foundation for the analysis of cladistic character compatibility
- Alignment of trees -- an alternative to tree edit
- Efficient algorithms for inferring evolutionary trees
- Finding a maximum compatible tree is NP-hard for sequences and trees
- Kaikoura tree theorems: Computing the maximum agreement subtree
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- On the Approximation of Shortest Common Supersequences and Longest Common Subsequences
- Optimization, approximation, and complexity classes
- Reconstructing evolution of sequences subject to recombination using parsimony
- Simple Fast Algorithms for the Editing Distance between Trees and Related Problems
- Sparse Dynamic Programming for Evolutionary-Tree Comparison
- Tree Compatibility and Inferring Evolutionary History
Cited in
(59)- Computing the maximum agreement of phylogenetic networks
- Theoretical Computer Science
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD
- A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees
- Strong core and Pareto-optimality in the multiple partners matching problem under lexicographic preference domains
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
- Fixed topology alignment with recombination
- Convex Characters, Algorithms, and Matchings
- Deep kernelization for the tree bisection and reconnection (TBR) distance in phylogenetics
- Stable and Pareto optimal group activity selection from ordinal preferences
- The maximum agreement forest problem: Approximation algorithms and computational experiments
- Faster exact computation of rSPR distance
- scientific article; zbMATH DE number 1615275 (Why is no real title available?)
- New results for the longest haplotype reconstruction problem
- SUBTREE TRANSFER DISTANCE FOR DEGREE-D PHYLOGENIES
- Computing the minimum number of hybridization events for a consistent evolutionary history
- Computing similarity between RNA structures
- A 3-approximation algorithm for the subtree distance between phylogenies
- Approximating maximum agreement forest on multiple binary trees
- Algorithms for parameterized maximum agreement forest problem on multiple trees
- A social choice approach to ordinal group activity selection
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
- Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks
- Exploring spaces of semi-directed level-1 networks
- Better practical algorithms for rSPR distance and hybridization number
- Complexity issues in vertex-colored graph pattern matching
- Maximum agreement and compatible supertrees
- Computing the rooted triplet distance between phylogenetic networks
- Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees
- On the approximability of the maximum agreement subtree and maximum compatible tree problems
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees
- Breaks, cuts, and patterns
- Improved algorithms for maximum agreement and compatible supertrees
- Bounding the number of hybridisation events for a consistent evolutionary history
- Approximating the maximum agreement forest on k trees
- Gene tree reconciliation including transfers with replacement is NP-hard and FPT
- Cyclic generators and an improved linear kernel for the rooted subtree prune and regraft distance
- Computing nearest neighbour interchange distances between ranked phylogenetic trees
- Computing balanced solutions for large international kidney exchange schemes when cycle length is unbounded
- Identifying approximately common substructures in trees based on a restricted edit distance
- An improved approximation algorithm for rSPR distance
- A new algorithm for inferring hybridization events based on the detection of horizontal gene transfers
- On contract-and-refine transformations between phylogenetic trees
- A tight kernel for computing the tree bisection and reconnection distance between two phylogenetic trees
- Fast comparison of evolutionary trees
- Reflections on kernelizing and computing unrooted agreement forests
- New reduction rules for the tree bisection and reconnection distance
- A duality based 2-approximation algorithm for maximum agreement forest
- On the fixed parameter tractability of agreement-based phylogenetic distances
- Split-or-decompose: improved FPT branching algorithms for maximum agreement forests
- Efficiently Calculating Evolutionary Tree Measures Using SAT
- Maximum Motif Problem in Vertex-Colored Graphs
- Extremal distances for subtree transfer operations in binary trees
- Inapproximability results for the lateral gene transfer problem
- Subtree transfer operations and their induced metrics on evolutionary trees
- Bounding the SNPR distance between two tree-child networks using generalised agreement forests
- The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics
- Analyzing and reconstructing reticulation networks under timing constraints
- Computing and Combinatorics
This page was built for publication: On the complexity of comparing evolutionary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961623)
