1. |
- Bandelt, HJ, et al.
(författare)
-
Quasi-median graphs from sets of partitions
- 2002
-
Ingår i: Discrete Applied Mathematics. - 0166-218X .- 1872-6771. ; 122:23-35, s. 23-35
-
Tidskriftsartikel (populärvet., debatt m.m.)abstract
- In studies of molecular evolution, one is typically confronted with the task of inferring a phylogenetic tree from a set X of sequences of length n over a finite alphabet Lambda. For studies that invoke parsimony, it has been found helpful to consider the quasi-median graph generated by X in the Hamming graph Lambda(n). Although a great deal is already known about quasi-median graphs (and their algebraic counterparts), little is known about the quasi-median generation in Lambda(n) starting from a set X of vertices. We describe the vertices of the quasi-median graph generated by X in terms of the coordinatewise partitions of X. In particular, we clarify when the generated quasi-median graph is the so-called relation graph associated with X. This immediately characterizes the instances where either a block graph or the total Hamming graph is generated.
|
|