Efficiently Calculating Evolutionary Tree Measures Using SAT
From MaRDI portal
(Redirected from Publication:3637154)
Recommendations
Cites work
- Combining Adaptive Noise and Look-Ahead in Local Search for SAT
- Computing and Combinatorics
- Computing the minimum number of hybridization events for a consistent evolutionary history
- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- March\_dl: adding adaptive heuristics and a new branching strategy
- On the complexity of comparing evolutionary trees
- On the computational complexity of the rooted subtree prune and regraft distance
- Optimal algorithms for comparing trees with labeled leaves
- SATzilla: portfolio-based algorithm selection for SAT
- Subtree transfer operations and their induced metrics on evolutionary trees
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
Cited in
(6)- Gene tree reconciliation including transfers with replacement is NP-hard and FPT
- Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
- Empirical study of the anatomy of modern SAT solvers
- The agreement distance of unrooted phylogenetic networks
- Extending Clause Learning of SAT Solvers with Boolean Gröbner Bases
- On CDCL-Based Proof Systems with the Ordered Decision Strategy
Describes a project that uses
Uses Software
This page was built for publication: Efficiently Calculating Evolutionary Tree Measures Using SAT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3637154)