Characterizing weak compatibility in terms of weighted quartets

DOI10.1016/J.AAM.2008.07.002MaRDI QIDQ1012157zbMATHOpenAlexFDO

Authors Stefan Grünewald, Katharina T. Huber, Charles Semple, Andreas Spillner, Vincent 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

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

Recommendations

• Encoding phylogenetic trees in terms of weighted quartets
• Quartets in maximal weakly compatible split systems
• Consistency of the QNet algorithm for generating planar split networks from weighted quartets
• Quartet compatibility and the quartet graph
• On the compatibility of quartet trees

Cites work

• scientific article; zbMATH DE number 1865935 (Why is no real title available?)
• scientific article; zbMATH DE number 905032 (Why is no real title available?)
• A canonical decomposition theory for metrics on a finite set
• Encoding phylogenetic trees in terms of weighted quartets
• Integer linear programming as a tool for constructing trees from quartet data
• Reconstructing the shape of a tree from observed dissimilarity data
• Tree structures for proximity data
• \(X\)-trees and weighted quartet systems

Cited in

(2)

• Quartets in maximal weakly compatible split systems
• Consistency of the QNet algorithm for generating planar split networks from weighted quartets

Describes a project that uses

Uses Software

• SplitsTree
• QNet

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1012157)