Recovering trees from well-separated multi-state characters.
From MaRDI portal
Publication:1427476
DOI10.1016/S0012-365X(03)00249-8zbMath1037.92025OpenAlexW2055596547MaRDI QIDQ1427476
Publication date: 14 March 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00249-8
Phylogenetic tree\(\mathbb Z_5\)-edge coloringConvexly definedRelation graphWell-separated characters
Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Tree reconstruction from multi-state characters
- Convex tree realizations of partitions
- The complexity of reconstructing trees from qualitative characters and subtrees
- On the number of vertices and edges of the Buneman graph
- Some variations on a theme by Buneman
- The relation graph
- Trees, taxonomy, and strongly compatible multi-state characters
- A characterization for a set of partial partitions to define an \(X\)-tree
- Quasi-median graphs from sets of partitions
- A characterisation of rigid circuit graphs
- Incidence matrices and interval graphs
- Triangulating Vertex-Colored Graphs
- Inferring Evolutionary History From DNA Sequences
- A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
- Two strikes against perfect phylogeny
- Efficient algorithms for inferring evolutionary trees
