Name
Abstract | ||
|---|---|---|
Previous work has shown the perhaps surprising result that, for any binary phylogenetic tree T, there is a set of four characters that define T. Here we deal with the general case, where T is an arbitrary X-tree. We show that if d is the maximum degree of any vertex in T, then the minimum number of characters that identify T is log(2) d (up to a small multiplicative constant). |
Year | Venue | Keywords |
|---|---|---|
2006 | ELECTRONIC JOURNAL OF COMBINATORICS | phylogenetic tree,maximum degree |
Field | DocType | Volume |
Discrete mathematics,Combinatorics,Vertex (geometry),Multiplicative function,Degree (graph theory),Mathematics,Binary number | Journal | 13.0 |
Issue | ISSN | Citations |
1.0 | 1077-8926 | 0 |
PageRank | References | Authors |
0.34 | 3 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Magnus Bordewich | 1 | 183 | 18.62 |
| Charles Semple | 2 | 43 | 4.38 |
| Mike Steel | 3 | 270 | 41.87 |