Reconstructing unrooted phylogenetic trees from symbolic ternary metrics

DOI10.1007/s11538-018-0413-7zbMath1396.92058arXiv1702.00190OpenAlexW2963662113WikidataQ88013567 ScholiaQ88013567MaRDI QIDQ1670475

Yangjing Long, Stefan Grünewald, Yaokun Wu

Publication date: 5 September 2018

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1702.00190

zbMATH Keywords

Median vertexsymbolic ternary metricunrooted phylogenetic tree

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats ⋮ Generalized Fitch graphs. II: Sets of binary relations that are explained by edge-labeled trees ⋮ Three-way symbolic tree-maps and ultrametrics ⋮ Generalized Fitch graphs: edge-labeled graphs that are explained by edge-labeled trees

Cites Work

• Decomposing complete edge-chromatic graphs and hypergraphs. Revisited
• Recovering symbolically dated, rooted trees from symbolic ultrametrics
• Orthology relations, symbolic ultrametrics, and cographs
• Basic Phylogenetic Combinatorics
• Tree structures for proximity data
• Symmetric Matrices Representable by Weighted Trees over a Cancellative Abelian Monoid
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Reconstructing unrooted phylogenetic trees from symbolic ternary metrics