On the complexity of constructing evolutionary trees
From MaRDI portal
Recommendations
Cited in
(35)- Computational complexity of inferring phylogenies from dissimilarity matrices
- The complexity of reconstructing trees from qualitative characters and subtrees
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- New heuristics for rooted triplet consistency
- Constructing the maximum consensus tree from rooted Triples
- Computing the maximum agreement of phylogenetic networks
- Computing minimum multiway cuts in hypergraphs
- Finding a maximum compatible tree is NP-hard for sequences and trees
- The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
- Faster exact computation of rSPR distance
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- Maximum agreement and compatible supertrees
- Evolutionary trees can be learned in polynomial time in the two-state general Markov model
- Aligning sequences via an evolutionary tree: complexity and approximation
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- The Complexity of Rooted Phylogeny Problems
- Finding a maximum likelihood tree is hard
- \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
- scientific article; zbMATH DE number 1303534 (Why is no real title available?)
- Constructing Evolutionary Trees in the Presence of Polymorphic Characters
- Complexity of Hierarchical Trees in Evidence Theory
- scientific article; zbMATH DE number 637307 (Why is no real title available?)
- scientific article; zbMATH DE number 1088267 (Why is no real title available?)
- Constructing Computer Virus Phylogenies
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD
- scientific article; zbMATH DE number 7564377 (Why is no real title available?)
- Research in Computational Molecular Biology
- On the complexity of comparing evolutionary trees
- Building a small and informative phylogenetic supertree
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function
- New results on optimizing rooted triplets consistency
- Learning latent tree models with small query complexity
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
This page was built for publication: On the complexity of constructing evolutionary trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1306398)
