Parity splits by triple point distances in X-trees
2006 (English)In: Annals of Combinatorics, ISSN 0218-0006, E-ISSN 0219-3094, Vol. 10, no 1, 1-18 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
2006. Vol. 10, no 1, 1-18 p.
phylogenetic tree, semilabelled, X-tree, graph metric, parity split
IdentifiersURN: urn:nbn:se:kth:diva-16099DOI: 10.1007/s00026-006-0270-1ISI: 000241669100002ScopusID: 2-s2.0-33745437713OAI: oai:DiVA.org:kth-16099DiVA: diva2:334141
QC 20100525 QC 20111004. Conference: Conference on Phylogenetic Combinatorics and Its Applications 2004. Uppsala, SWEDEN. JUL 05-09, 20042010-08-052010-08-052011-10-04Bibliographically approved