On the compatibility of quartet trees
From MaRDI portal
Recommendations
Cited in
(20)- Quartet compatibility and the quartet graph
- Characterizing weak compatibility in terms of weighted quartets
- X-trees and weighted quartet systems
- Reconstructing phylogenetic trees from multipartite quartet systems
- A high quartet distance construction
- On the maximum quartet distance between phylogenetic trees
- Onq-trees
- scientific article; zbMATH DE number 1026279 (Why is no real title available?)
- scientific article; zbMATH DE number 1160629 (Why is no real title available?)
- Bounding the maximum size of a minimal definitive set of quartets
- Reconstructing phylogenetic tree from multipartite quartet system
- On the compatibility of quartet trees
- A linear time approximation scheme for maximum quartet consistency on sparse sampled inputs
- A linear time approximation scheme for maximum quartet consistency on sparse sampled inputs
- On the quartet distance given partial information
- Slim sets of binary trees
- On the maximum size of minimal definitive quartet sets
- Simultaneous separation in bounded degree trees
- Quartets in maximal weakly compatible split systems
- Combinatorics of linked systems of quartet trees
This page was built for publication: On the compatibility of quartet trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2935283)
