On the approximation of computing evolutionary trees
From MaRDI portal
Recommendations
- On the approximability of the maximum agreement subtree and maximum compatible tree problems
- Linear time 3-approximation for the MAST problem
- On the complexity of comparing evolutionary trees
- Sparse Dynamic Programming for Evolutionary-Tree Comparison
- Maximum agreement and compatible supertrees (extended abstract)
Cited in
(23)- On the approximability of the maximum agreement subtree and maximum compatible tree problems
- A combinatorial description of the closest tree algorithm for finding evolutionary trees
- Fourier calculus on evolutionary trees
- Estimating the bias on the LogDeterminant transformation for evolutionary trees
- Applying the Thorne-Kishino-Felsenstein model to sequence evolution on a star-shaped tree
- The number of evolutionary steps on random and minimum length trees for random evolutionary data
- Improved approximation for spanning star forest in dense graphs
- Improved approximation algorithms for the spanning star forest problem
- Maximum agreement and compatible supertrees
- An algorithm for the maximum likelihood problem on evolutionary trees
- Evolutionary trees can be learned in polynomial time in the two-state general Markov model
- On variants of the spanning star forest problem
- An Improved Approximation Bound for Spanning Star Forest and Color Saving
- scientific article; zbMATH DE number 53861 (Why is no real title available?)
- Analogs and duals of the MAST problem for sequences and trees
- scientific article; zbMATH DE number 637307 (Why is no real title available?)
- Approximating the complement of the maximum compatible subset of leaves of k trees
- Linear time 3-approximation for the MAST problem
- On the star forest polytope for trees and cycles
- Ancestors and descendants in evolving k‐tree models
- Maximum likelihood of evolutionary trees is hard (extended abstract)
- On the complexity of comparing evolutionary trees
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees
This page was built for publication: On the approximation of computing evolutionary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5716929)