Patchworks

DOI10.1006/aima.1999.1912zbMath0979.05099OpenAlexW4213370899MaRDI QIDQ5927521

Sebastian Böcker, Andreas W. M. Dress

Publication date: 17 February 2002

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

Full work available at URL: https://doi.org/10.1006/aima.1999.1912

zbMATH Keywords

cluster systemshierarchical clustering

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Extremal set theory (05D05)

Related Items (6)

Combinatorial properties of triplet covers for binary trees ⋮ A Hall-type theorem for triplet set systems based on medians in trees ⋮ On some categories of structured sets ⋮ Slim sets of binary trees ⋮ Phylogenetic flexibility via Hall-type inequalities and submodularity ⋮ Set relations and set systems induced by some families of integral domains

Cites Work

• Reconstructing the shape of a tree from observed dissimilarity data
• Patching up \(X\)-trees
• Trees, taxonomy, and strongly compatible multi-state characters
• Tree structures for proximity data
• Algorithmic Aspects of Tree Amalgamation

This page was built for publication: Patchworks