Trees, taxonomy, and strongly compatible multi-state characters

DOI10.1006/aama.1996.0503zbMath0879.92003MaRDI QIDQ1364321

Andreas W. M. Dress, Mike A. Steel, Vincent L. Moulton

Publication date: 25 August 1997

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

Full work available at URL: https://semanticscholar.org/paper/81726b49e154bb3f543d2b3179b35926e5895cdd

zbMATH Keywords

clustering; block graphs; tree structure; block systems; binary characters; block interval systems; strongly compatible

Mathematics Subject Classification ID

91C20: Clustering in the social and behavioral sciences

05C05: Trees

05C90: Applications of graph theory

92B10: Taxonomy, cladistics, statistics in mathematical biology

05C40: Connectivity

Related Items

Patchworks, Compatible decompositions and block realizations of finite metrics, A graph-theoretical invariant of topological spaces, Recovering trees from well-separated multi-state characters., Quasi-median graphs from sets of partitions, A polynomial time algorithm for constructing the refined Buneman tree, Hyperbolic bridged graphs, Replacing cliques by stars in quasi-median graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Reconstructing the shape of a tree from observed dissimilarity data
• Trees, tight extensions of metric spaces, and the cohomological dimension of certain groups: A note on combinatorial properties of metric spaces
• Distance-hereditary graphs
• Valuated matroids
• Convex tree realizations of partitions
• The complexity of reconstructing trees from qualitative characters and subtrees
• On metric properties of certain clique graphs
• A combinatorial approach to \(p\)-adic geometry
• \(T\)-theory: An overview
• Graph-theoretic parameters concerning domination, independence, and irredundance
• Triangulating Vertex-Colored Graphs
• A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
• Two strikes against perfect phylogeny