Metrics for Phylogenetic Networks I: Generalizations of the Robinson-Foulds Metric

被引:42
作者
Cardona, Gabriel [1 ]
Llabres, Merce [1 ]
Rossello, Francesc [1 ]
Valiente, Gabriel [2 ]
机构
[1] Univ Balearic Isl, Dept Math & Comp Sci, E-07122 Palma de Mallorca, Spain
[2] Tech Univ Catalonia, Formal Methods Res Grp, E-08034 Barcelona, Spain
关键词
Biology and genetics; life and medical sciences; computer applications; graph algorithms; graph theory; discrete mathematics; mathematics of computing; trees; RECOMBINATION EVENTS; MINIMUM NUMBER; GENE-TRANSFER; ALGORITHMS; BACTERIAL; DISTANCE;
D O I
10.1109/TCBB.2008.70
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
The assessment of phylogenetic network reconstruction methods requires the ability to compare phylogenetic networks. This is the first in a series of papers devoted to the analysis and comparison of metrics for tree-child time-consistent phylogenetic networks on the same set of taxa. In this paper, we study three metrics that have already been introduced in the literature: the Robinson-Foulds distance, the tripartition distance, and the mu-distance. They generalize to networks the classical Robinson-Foulds or partition distance for phylogenetic trees. We analyze the behavior of these metrics by studying their least and largest values and when they achieve them. As a by-product of this study, we obtain tight bounds on the size of a tree-child time-consistent phylogenetic network.
引用
收藏
页码:46 / 61
页数:16
相关论文
共 34 条
[1]  
Alberts B., 2007, Molecular Biology of the Cell. (4th edition), Vfifth
[2]  
[Anonymous], 1992, PLANT TAXONOMY BIOSY
[3]  
[Anonymous], 2002, ALGORITHMS TREES GRA
[4]  
[Anonymous], 2003, Molecular Biology of the Gene
[5]   The number of recombination events in a sample history: Conflict graph and lower bounds [J].
Bafna, V ;
Bansal, V .
IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2004, 1 (02) :78-90
[6]   Hybrids in real time [J].
Baroni, M ;
Semple, C ;
Steel, M .
SYSTEMATIC BIOLOGY, 2006, 55 (01) :46-56
[7]  
Baroni Mihaela, 2005, Ann. Comb., V8, P391
[8]   Computing the minimum number of hybridization events for a consistent evolutionary history [J].
Bordewich, Magnus ;
Semple, Charles .
DISCRETE APPLIED MATHEMATICS, 2007, 155 (08) :914-928
[9]  
BURKHARDT F, 1987, CORRESPONDENCE C DAR, V2
[10]  
CARDONA G, 2008, METRICS PHYLOGENETIC, V3