On the compatibility of quartet trees
From MaRDI portal
Publication:2935283
DOI10.1137/130941043zbMATH Open1349.92102OpenAlexW2046167819MaRDI QIDQ2935283FDOQ2935283
Authors: Noga Alon, Sagi Snir, Raphael Yuster
Publication date: 22 December 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/130941043
Recommendations
Cited In (17)
- Title not available (Why is that?)
- On the maximum quartet distance between phylogenetic trees
- Quartets in maximal weakly compatible split systems
- Bounding the maximum size of a minimal definitive set of quartets
- Characterizing weak compatibility in terms of weighted quartets
- On the maximum size of minimal definitive quartet sets
- On the quartet distance given partial information
- \(X\)-trees and weighted quartet systems
- Combinatorics of linked systems of quartet trees
- Reconstructing phylogenetic trees from multipartite quartet systems
- 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
- Quartet compatibility and the quartet graph
- Onq-trees
- Slim sets of binary trees
- A high quartet distance construction
- On the compatibility 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)