Pages that link to "Item:Q1195647"
From MaRDI portal
The following pages link to Convex tree realizations of partitions (Q1195647):
Displaying 15 items.
- A simple characterization of the minimal obstruction sets for three-state perfect phylogenies (Q450220) (← links)
- Binary space partitioning trees as an alternative representation of polytopes (Q805288) (← links)
- Converse to the Parter--Wiener theorem: the case of non-trees (Q856860) (← links)
- Convex recolorings of strings and trees: Definitions, hardness results and algorithms (Q931727) (← links)
- The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q1281766) (← links)
- Trees, taxonomy, and strongly compatible multi-state characters (Q1364321) (← links)
- Recovering trees from well-separated multi-state characters. (Q1427476) (← links)
- A characterization for a set of partial partitions to define an \(X\)-tree (Q1598797) (← links)
- Graham's tree reconstruction conjecture and a Waring-type problem on partitions (Q1750663) (← links)
- Finding a maximum compatible tree is NP-hard for sequences and trees (Q1921170) (← links)
- The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees (Q1962070) (← links)
- Compatibility of partitions with trees, hierarchies, and split systems (Q2127632) (← links)
- Efficient approximation of convex recolorings (Q2643731) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q6487426) (← links)
