Name
Abstract | ||
|---|---|---|
Fitch graphs have been introduced as a model of xenology relationships in phylogenomics. Directed Fitch graphs G = (X, E) are di-graphs that are explained by {0, 1}-edge-labeled rooted trees with leaf set X: there is an arc xy ∈ E if and only if the unique path in T that connects the least common ancestor lca(x, y) of x and y with y contains at least one edge with label 1. In this contribution, we consider the undirected version of Fitch’s xenology relation, in which x and y are xenologs if and only if the unique path between x and y in T contains an edge with label 1. We show that symmetric Fitch relations coincide with class of complete multipartite graph and thus cannot convey any non-trivial phylogenetic information. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.26493/2590-9770.1245.98c | Art Discret. Appl. Math. |
Field | DocType | Volume |
Graph,Combinatorics,Lowest common ancestor,Phylogenetic tree,Multipartite graph,If and only if,Phylogenomics,Phylogenetics,Mathematics | Journal | 1 |
Issue | Citations | PageRank |
1 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| marc hellmuth | 1 | 148 | 22.80 |
| Yangjing Long | 2 | 0 | 0.34 |
| Manuela Geiß | 3 | 0 | 0.34 |
| Peter F. Stadler | 4 | 256 | 62.77 |