Trees, taxonomy, and strongly compatible multi-state characters

DOI10.1006/aama.1996.0503zbMath0879.92003OpenAlexW2044420482MaRDI 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

clusteringblock graphstree structureblock systemsbinary charactersblock interval systemsstrongly compatible

Mathematics Subject Classification ID

Clustering in the social and behavioral sciences (91C20) Trees (05C05) Applications of graph theory (05C90) Taxonomy, cladistics, statistics in mathematical biology (92B10) Connectivity (05C40)

Related Items (13)

Quasi-median graphs from sets of partitions ⋮ Replacing cliques by stars in quasi-median graphs ⋮ Visualization of quasi-median networks ⋮ Recovering trees from well-separated multi-state characters. ⋮ Computing the blocks of a quasi-median graph ⋮ Compatible decompositions and block realizations of finite metrics ⋮ Patchworks ⋮ A polynomial time algorithm for constructing the refined Buneman tree ⋮ TREE STRUCTURES ON CERTAIN FAMILIES OF PARTITIONS ⋮ A graph-theoretical invariant of topological spaces ⋮ Encoding and ordering \(X\)-cactuses ⋮ On soft quasi-pseudometric spaces ⋮ Hyperbolic bridged graphs

Cites Work

• 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
• Infinite tree algebras
• 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

This page was built for publication: Trees, taxonomy, and strongly compatible multi-state characters