首页 | 本学科首页   官方微博 | 高级检索  
   检索      


Tripartitions do not always discriminate phylogenetic networks
Authors:Cardona Gabriel  Rosselló Francesc  Valiente Gabriel
Institution:a Department of Mathematics and Computer Science, University of the Balearic Islands, E-07122 Palma de Mallorca, Spain
b Algorithms, Bioinformatics, Complexity and Formal Methods Research Group, Technical University of Catalonia, E-08034 Barcelona, Spain
c Research Institute of Health Science (IUNICS), University of the Balearic Islands, E-07122 Palma de Mallorca, Spain
Abstract:Phylogenetic networks are a generalization of phylogenetic trees that allow for the representation of non-treelike evolutionary events, like recombination, hybridization, or lateral gene transfer. In a recent series of papers devoted to the study of reconstructibility of phylogenetic networks, Moret, Nakhleh, Warnow and collaborators introduced the so-called tripartition metric for phylogenetic networks. In this paper we show that, in fact, this tripartition metric does not satisfy the separation axiom of distances (zero distance means isomorphism, or, in a more relaxed version, zero distance means indistinguishability in some specific sense) in any of the subclasses of phylogenetic networks where it is claimed to do so. We also present a subclass of phylogenetic networks whose members can be singled out by means of their sets of tripartitions (or even clusters), and hence where the latter can be used to define a meaningful metric.
Keywords:Phylogenetic networks  Recombination  Bipartitions  Tripartitions  Tripartition metric  Error metric
本文献已被 ScienceDirect PubMed 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号