Sökning: onr:"swepub:oai:DiVA.org:kth-16099" >
Parity splits by tr...
Parity splits by triple point distances in X-trees
-
Backelin, Jörgen (författare)
-
- Linusson, Svante (författare)
- KTH,Matematik (Avd.)
-
KTH Matematik (Avd) (creator_code:org_t)
- Springer Science and Business Media LLC, 2006
- 2006
- Engelska.
-
Ingår i: Annals of Combinatorics. - : Springer Science and Business Media LLC. - 0218-0006 .- 0219-3094. ; 10:1, s. 1-18
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- At the conference Dress defined parity split maps by triple point distance and asked for a characterisation of such maps coming from binary phylogenetic X-trees. This article gives an answer to that question. The characterisation for X-trees can be easily described as follows: If all restrictions of a split map to sets of five or fewer elements is a parity split map for an X-tree, then so is the entire map. To ensure that the parity split map comes from an X-tree which is binary and phylogenetic, we add two more technical conditions also based on studying at most five points at a time.
Ämnesord
- NATURVETENSKAP -- Matematik (hsv//swe)
- NATURAL SCIENCES -- Mathematics (hsv//eng)
Nyckelord
- phylogenetic tree
- semilabelled
- X-tree
- graph metric
- parity split
Publikations- och innehållstyp
- ref (ämneskategori)
- art (ämneskategori)
Hitta via bibliotek
Till lärosätets databas