Minimum tree cost quartet puzzling
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1405796 (Why is no real title available?)
- A fixed-parameter algorithm for minimum quartet inconsistency
- A polynomial time algorithm for the minimum quartet inconsistency problem with O(n) quartet errors
- Comparison of phylogenetic trees
- Consensus n-trees
- Constructing big trees from short sequences
- Inferring evolutionary trees with strong combinatorial evidence
- Performance study of phylogenetic methods: (unweighted) quartet methods and neighbor-joining
- Reconstructing the shape of a tree from observed dissimilarity data
- The complexity of reconstructing trees from qualitative characters and subtrees
Cited in
(8)- Computing phylogenetic trees using topologically related minimum spanning trees
- Improved metaheuristics for the quartet method of hierarchical clustering
- scientific article; zbMATH DE number 1746441 (Why is no real title available?)
- A new quartet approach for reconstructing phylogenetic trees: Quartet joining method
- An exact algorithm for the minimum quartet tree cost problem
- A fast quartet tree heuristic for hierarchical clustering
- Optimal subtree prune and regraft for quartet score in sub-quadratic time
- Constructing optimal trees from quartets
This page was built for publication: Minimum tree cost quartet puzzling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q263274)