#### DMCA

## Accumulation Phylogenies (2004)

### Cached

### Download Links

Citations: | 4 - 0 self |

### Citations

445 | Inferring Phylogenies - Felsenstein - 2004 |

366 | Digraphs: Theory, Algorithms and Applications
- Jorgen, Gutin
- 1979
(Show Context)
Citation Context ...econd, respectively first co-ordinate). In this paper we will be concerned only with acyclic digraphs (that is, digraphs that have no directed cycles). More details regarding digraphs can be found in =-=[1]-=-. A rooted digraph is an acylic digraph D = (V,A) with a distinguished vertex ρ (called the root) that has the property that d − (ρ) = 0 and for which there exists a directed path from ρ to every vert... |

248 |
The recovery of trees from measures of dissimilairty
- Buneman
- 1971
(Show Context)
Citation Context ...on phylogeny. We would like to be able to characterise when the unique regular hybrid phylogeny D that induces γ is a rooted phylogenetic tree. It is a well-known, classical result (see, for example, =-=[5]-=-) that any collection C of sets (in particular A(γ)) forms the clusters of a rooted tree if and only if C is a hierarchy — that is, any two sets in C are either disjoint, or one is contained in the ot... |

136 |
Genome phylogeny based on gene content
- Snel, Bork, et al.
- 1999
(Show Context)
Citation Context ... (ii) S is sufficiently extensive that each descendant species acquires at least one new gene (condition (P2)). Recently, the gene content of species has been used for reconstructing phylogenies (see =-=[16]-=-) by constructing measures of (dis)similarity based on the amount of genes shared by two species (we consider this further in the next section). The approach we consider here may provide an alternativ... |

68 | Phylogenetic networks: modeling, reconstructibility, and accuracy - Moret, Nakhleh, et al. - 2004 |

58 | Reconstructing reticulate evolution in species – Theory and practice - Nakhleh, Warnow, et al. - 2004 |

48 | A framework for representing reticulate evolution
- Baroni, Semple, et al.
(Show Context)
Citation Context ...on in the presence of reticulation (whereby new species contain genetic contributions from two or more ancestral species) [8–14]. Further mathematical background on hybrid phylogenies can be found in =-=[2]-=-, while for rooted phylogenetic trees the reader is referred to [15]. 1.2. Accumulation PhylogeniessAccumulation Phylogenies 21 Let S be any (finite or infinite) set. An accumulation phylogeny on X is... |

42 | Towards the development of computational tools for evaluating phylogenetic network reconstruction methods - Nakhleh, Sun, et al. - 2003 |

41 | The fine structure of galls in phylogenetic networks - Gusfield, Eddhu, et al. |

28 | Inferring a Level-1 Phylogenetic Network from a Dense Set of Rooted Triplets - Jansson, Sung - 2006 |

25 | Reconstruction of biogeographic and evolutionary networks using reticulograms. Syst. Biol - Legendre, Makarenkov - 2002 |

23 | NeighborNet: An agglomerative algorithm for the construction of planar phylogenetic networks - Bryant, Moulton |

8 | Recovering symbolically dated, rooted trees from symbolic ultrametrics
- Böcker, Dress
- 1998
(Show Context)
Citation Context ... to consider any map γ: X → 2 S and define Dγ : X × X → 2 S by Dγ(x, y) = γ(x) ∩ γ(y). It turns out that when γ is induced by a rooted phylogenetic tree then Dγ is an example of what Böcker and Dress =-=[3]-=- have called a symbolic ultrametric, and which is defined as follows. Let M be an arbitrary set. A map δ from X × X into M is said to be an symbolic ultrametric (on X) if each of the following conditi... |

8 | 2000b). Biological applications of reticulation analysis - Legendre |

6 | Analysing and visualizing sequence and distance data using splitstree - Dress, Huson, et al. - 1996 |