Sökning: onr:"swepub:oai:DiVA.org:uu-71819" >
Quasi-median graphs...
Quasi-median graphs from sets of partitions
-
Bandelt, HJ (författare)
-
- Huber, Katharina T (författare)
- Mittuniversitetet,Uppsala universitet,Centrum för bioinformatik,Institutionen för teknik, fysik och matematik (-2008)
-
- Moulton, Vincent (författare)
- Mittuniversitetet,Uppsala universitet,Centrum för bioinformatik,Institutionen för teknik, fysik och matematik (-2008)
-
(creator_code:org_t)
- 2002
- 2002
- Engelska.
-
Ingår i: Discrete Applied Mathematics. - 0166-218X .- 1872-6771. ; 122:23-35, s. 23-35
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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.
Ämnesord
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Nyckelord
- MATHEMATICS
- MATEMATIK
Publikations- och innehållstyp
- pop (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas