Characterizing weak compatibility in terms of weighted quartets

DOI10.1016/j.aam.2008.07.002zbMath1158.92034OpenAlexW2101874514MaRDI QIDQ1012157

Stefan Grünewald, Katharina T. Huber, Charles Semple, Andreas Spillner, Vincent L. Moulton

Publication date: 14 April 2009

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aam.2008.07.002

zbMATH Keywords

phylogeneticsweak compatibilityquartet

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Graph theory (05C99) Computational methods for problems pertaining to biology (92-08)

Related Items (1)

Quartets in maximal weakly compatible split systems

Uses Software

• SplitsTree
• QNet

Cites Work

• Reconstructing the shape of a tree from observed dissimilarity data
• Encoding phylogenetic trees in terms of weighted quartets
• A canonical decomposition theory for metrics on a finite set
• \(X\)-trees and weighted quartet systems
• Integer linear programming as a tool for constructing trees from quartet data
• Tree structures for proximity data
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizing weak compatibility in terms of weighted quartets