A Short Note on Undirected Fitch Graphs
Manuela Gei{\ss}, Marc Hellmuth, Yangjing Long, Peter F. Stadler
TL;DR
This paper discusses the properties of undirected Fitch graphs, showing they are equivalent to complete multipartite graphs and thus lack non-trivial phylogenetic information.
Contribution
It clarifies the structure of undirected Fitch graphs and highlights their limitations in conveying phylogenetic relationships.
Findings
Undirected Fitch graphs are complete multipartite graphs.
They do not carry non-trivial phylogenetic information.
The symmetric Fitch relation simplifies to a well-known graph class.
Abstract
The symmetric version of Fitch's xenology relation coincides with class of complete multipartite graph and thus cannot convey any non-trivial phylogenetic information.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Genome Rearrangement Algorithms · Genomics and Phylogenetic Studies