On the complexity of constructing evolutionary trees
From MaRDI portal
Publication:1306398
DOI10.1023/A:1009833626004zbMATH Open0957.90111OpenAlexW1559569263MaRDI QIDQ1306398FDOQ1306398
Andrzej Lingas, Leszek Gąsieniec, Anna Östlin, Jesper Jansson
Publication date: 21 November 1999
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1009833626004
Recommendations
Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (29)
- New results on optimizing rooted triplets consistency
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD
- The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets
- New heuristics for rooted triplet consistency
- Constructing Computer Virus Phylogenies
- Faster exact computation of rSPR distance
- Computational complexity of inferring phylogenies from dissimilarity matrices
- The complexity of reconstructing trees from qualitative characters and subtrees
- Encoding and constructing 1-nested phylogenetic networks with trinets
- Constructing the maximum consensus tree from rooted Triples
- Complexity of Hierarchical Trees in Evidence Theory
- A polynomial time algorithm for finding a minimum 4-partition of a submodular function
- Title not available (Why is that?)
- The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
- Constructing Evolutionary Trees in the Presence of Polymorphic Characters
- Maximum agreement and compatible supertrees
- Building a small and informative phylogenetic supertree
- Research in Computational Molecular Biology
- Computing minimum multiway cuts in hypergraphs
- Evolutionary trees can be learned in polynomial time in the two-state general Markov model
- 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
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems
- \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
- Title not available (Why is that?)
- The Complexity of Rooted Phylogeny Problems
- Computing the maximum agreement of phylogenetic networks
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)
