Trees, taxonomy, and strongly compatible multi-state characters

DOI10.1006/AAMA.1996.0503MaRDI QIDQ1364321zbMATH OpenOpenAlexFDO

Authors Andreas W. M. Dress, Vincent Moulton, Mike Steel

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

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

Recommendations

• Tree-tree matrices and other combinatorial problems from taxonomy
• Tree reconstruction from multi-state characters
• Recovering trees from well-separated multi-state characters.
• On the Generalised Character Compatibility Problem for Non-branching Character Trees
• The complexity of reconstructing trees from qualitative characters and subtrees
• Characterization of total very excellent trees
• On the status sequences of trees
• scientific article; zbMATH DE number 3843798
• Representability of trees and some of their applications
• On a Characterization of Trees

Cites work

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

Cited in

(13)

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

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

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