Name
Abstract | ||
|---|---|---|
Phylogenetic networks were introduced to describe evolution in the presence of exchanges of genetic material between coexisting species or individuals. Split networks in particular were introduced as a special kind of abstract network to visualize conflicts between phylogenetic trees which may correspond to such exchanges. More recently, methods were designed to reconstruct explicit phylogenetic networks (whose vertices can be interpreted as biological events) from triplet data. In this article, we link abstract and explicit networks through their combinatorial properties, by introducing the unrooted analog of level-k networks. In particular, we give an equivalence theorem between circular split systems and unrooted level-1 networks. We also show how to adapt to quartets some existing results on triplets, in order to reconstruct unrooted level-k phylogenetic networks. These results give an interesting perspective on the combinatorics of phylogenetic networks and also raise algorithmic and combinatorial questions. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1142/S0219720012500047 | JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY |
Keywords | Field | DocType |
Phylogenetic networks,quartets,level-k networks,NP-hardness,exact algorithms | Discrete mathematics,Phylogenetic tree,Vertex (geometry),Split networks,Equivalence (measure theory),Mathematics,Phylogenetic network | Journal |
Volume | Issue | ISSN |
10 | 4 | 0219-7200 |
Citations | PageRank | References |
7 | 0.53 | 18 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Philippe Gambette | 1 | 77 | 9.61 |
| Vincent Berry | 2 | 87 | 6.87 |
| Christophe Paul | 3 | 147 | 9.72 |