Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees

DOI10.46298/dmtcs.6040zbMath1498.05058arXiv2001.05921OpenAlexW3000021317MaRDI QIDQ5038192

Peter F. Stadler, Marc Hellmuth, Carsten R. Seemann

Publication date: 30 September 2022

Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

NP-completenesslabeled treesphylogeneticsrecognition algorithmFitch relationssplits and quartetssymmetrized maps

Mathematics Subject Classification ID

Trees (05C05) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Genetics and epigenetics (92D10)

Related Items (1)

Compatibility of partitions with trees, hierarchies, and split systems

This page was built for publication: Generalized Fitch Graphs III: Symmetrized Fitch maps and Sets of Symmetric Binary Relations that are explained by Unrooted Edge-labeled Trees