Convex tree realizations of partitions

DOI10.1016/0893-9659(92)90026-6zbMath0759.05005OpenAlexW2048878652MaRDI QIDQ1195647

Andreas W. M. Dress, Mike A. Steel

Publication date: 6 January 1993

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

Full work available at URL: https://doi.org/10.1016/0893-9659(92)90026-6

zbMATH Keywords

partitionsconvex tree realizations

Mathematics Subject Classification ID

Trees (05C05) Partitions of sets (05A18) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (8)

Efficient approximation of convex recolorings ⋮ Trees, taxonomy, and strongly compatible multi-state characters ⋮ Finding a maximum compatible tree is NP-hard for sequences and trees ⋮ A simple characterization of the minimal obstruction sets for three-state perfect phylogenies ⋮ Recovering trees from well-separated multi-state characters. ⋮ Convex recolorings of strings and trees: Definitions, hardness results and algorithms ⋮ The complexity of reconstructing trees from qualitative characters and subtrees ⋮ On the approximability of the Steiner tree problem in phylogeny

Cites Work

• Reconstructing the shape of a tree from observed dissimilarity data
• From copair hypergraphs to median graphs with latent vertices
• When are two qualitative taxonomic characters compatible?
• An algebraic analysis of cladistic characters
• A characterisation of rigid circuit graphs
• Efficient algorithms for inferring evolutionary trees

This page was built for publication: Convex tree realizations of partitions