\(X\)-trees and weighted quartet systems

DOI10.1007/s00026-003-0179-xzbMath1020.05019OpenAlexW2011572535MaRDI QIDQ1407497

Péter L. Erdős, Andreas W. M. Dress

Publication date: 16 September 2003

Published in: Annals of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00026-003-0179-x

zbMATH Keywords

phylogenyevolutionary treestree-reconstruction

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) General biology and biomathematics (92B05)

Related Items (8)

`Lassoing' a phylogenetic tree. I: Basic properties, shellings, and covers ⋮ Split decomposition over an Abelian group. I: Generalities ⋮ Encoding phylogenetic trees in terms of weighted quartets ⋮ Quarnet inference rules for level-1 networks ⋮ Characterizing weak compatibility in terms of weighted quartets ⋮ Consistency of the QNet algorithm for generating planar split networks from weighted quartets ⋮ Split decomposition over an Abelian group. II: Group-valued split systems with weakly compatible support ⋮ Inferring metric trees from weighted quartets via an intertaxon distance

This page was built for publication: \(X\)-trees and weighted quartet systems