The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January-March (2009 vol.6)
pp: 46-61
Gabriel Cardona , University of the Balearic Islands, Palma de Mallorca
Mercè Llabrés , University of the Balearic Islands, Palma de Mallorca
Francesc Rosselló , University of the Balearic Islands, Palma de Mallorca
Gabriel Valiente , Technical University of Catalonia, Barcelona
ABSTRACT
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 tripartitions 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.
INDEX TERMS
Biology and genetics, Graph algorithms, Trees
CITATION
Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, Gabriel Valiente, "Metrics for Phylogenetic Networks I: Generalizations of the Robinson-Foulds Metric", IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol.6, no. 1, pp. 46-61, January-March 2009, doi:10.1109/TCBB.2008.70
REFERENCES
[1] B. Alberts, A. Johnson, J. Lewis, M. Raff, K. Roberts, and P. Walter, Molecular Biology of the Cell, fourth ed. Garland Science, 2002.
[2] V. Bafna and V. Bansal, “The Number of Recombination Events in a Sample History: Conflict Graph and Lower Bounds,” IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 1, no. 2, pp. 78-90, Apr.-June 2004.
[3] M. Baroni, C. Semple, and M. Steel, “A Framework for Representing Reticulate Evolution,” Annals of Combinatorics, vol. 8, pp. 391-408, 2004.
[4] M. Baroni, C. Semple, and M. Steel, “Hybrids in Real Time,” Systematic Biology, vol. 55, pp. 46-56, 2006.
[5] M. Bordewich and C. Semple, “Computing the Minimum Number of Hybridization Events for a Consistent Evolutionary History,” Discrete Applied Math., vol. 155, no. 8, pp. 914-928, 2007.
[6] The Correspondence of Charles Darwin, F. Burkhardt and S.Smith,eds., vol. 2. Cambridge Univ. Press, 1987.
[7] G. Cardona, M. Llabrés, F. Rosselló, and G. Valiente, “A Distance Metric for a Class of Tree-Sibling Phylogenetic Networks,” Bioinformatics, vol. 24, no. 13, pp. 1481-1488, 2008.
[8] G. Cardona, M. Llabrés, F. Rosselló, and G. Valiente, “Metrics for Phylogenetic Networks II: Nodal and Triplets Metrics,” IEEE/ACM Trans. Computational Biology and Bioinformatics, to appear.
[9] G. Cardona, M. Llabrés, F. Rosselló, and G. Valiente, Metrics for Phylogenetic Networks III: Comparison of Metrics, in preparation, 2008.
[10] G. Cardona, F. Rosselló, and G. Valiente, “Comparison of Tree-Child Phylogenetic Networks,” IEEE/ACM Trans. Computational Biology and Bioinformatics, to appear.
[11] G. Cardona, F. Rosselló, and G. Valiente, “Tripartitions Do Not Always Discriminate Phylogenetic Networks,” Math. Biosciences, vol. 211, no. 2, pp. 356-370, 2008.
[12] W.F. Doolittle, “Phylogenetic Classification and the Universal Tree,” Science, vol. 284, no. 5423, pp. 2124-2128, 1999.
[13] S. Garcia-Vallvé, A. Romeu, and J. Palau, “Horizontal Gene Transfer in Bacterial and Archaeal Complete Genomes,” Genome Research, vol. 10, no. 11, pp. 1719-1725, 2000.
[14] D. Gusfield, S. Eddhu, and C. Langley, “The Fine Structure of Galls in Phylogenetic Networks,” INFORMS J. Computing, vol. 16, no. 4, pp. 459-469, 2004.
[15] D. Gusfield, S. Eddhu, and C. Langley, “Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination,” J. Bioinformatics and Computational Biology, vol. 2, no. 1, pp. 173-213, 2004.
[16] B. Holland, G. Conner, K. Huber, and V. Moulton, “Imputing Supertrees and Supernetworks from Quartets,” Systematic Biology, vol. 56, no. 1, pp. 57-67, 2007.
[17] W.S. Judd, C.S. Campbell, E.A. Kellogg, P.F. Stevens, and M.J. Donoghue, Plant Systematics. A Phylogenetic Approach, thirded. Sinauer Assoc., 2007.
[18] B.M.E. Moret, L. Nakhleh, T. Warnow, C.R. Linder, A. Tholse, A. Padolina, J. Sun, and R. Timme, “Phylogenetic Networks: Modeling, Reconstructibility, and Accuracy,” IEEE/ACM Trans. Computational Biology and Bioinformatics, vol. 1, no. 1, pp. 13-23, Jan.-Mar. 2004.
[19] S.R. Myers and R.C. Griffiths, “Bounds on the Minimum Number of Recombination Events in a Sample History,” Genetics, vol. 163, no. 1, pp. 375-394, 2003.
[20] L. Nakhleh, J. Sun, T. Warnow, C.R. Linder, B.M.E. Moret, and A. Tholse, “Towards the Development of Computational Tools for Evaluating Phylogenetic Network Reconstruction Methods,” Proc. Eighth Pacific Symp. Biocomputing (PSB), 2003.
[21] L. Nakhleh, T. Warnow, C.R. Linder, and K.S. John, “Reconstructing Reticulate Evolution in Species: Theory and Practice,” J. Computational Biology, vol. 12, no. 6, pp. 796-811, 2005.
[22] N.B. Nguyen, C.T. Nguyen, and W.-K. Sung, “Fast Algorithms for Computing the Tripartition-Based Distance between Phylogenetic Networks,” J. Combinatorial Optimization, vol. 13, no. 3, pp. 223-242, 2007.
[23] H. Ochman, J.G. Lawrence, and E.A. Groisman, “Lateral Gene Transfer and the Nature of Bacterial Innovation,” Nature, vol. 405, no. 6784, pp. 299-304, 2000.
[24] M. Pagel, “Inferring the Historical Patterns of Biological Evolution,” Nature, vol. 401, no. 6756, pp. 877-884, 1999.
[25] D.F. Robinson and L.R. Foulds, “Comparison of Phylogenetic Trees,” Math. Biosciences, vol. 53, nos. 1/2, pp. 131-147, 1981.
[26] Y.S. Song and J. Hein, “Constructing Minimal Ancestral Recombination Graphs,” J. Computational Biology, vol. 12, no. 2, pp. 147-169, 2005.
[27] C.A. Stace, Plant Taxonomy and Biosystematics, second ed. CambridgeUniv. Press, 1992.
[28] G. Valiente, Algorithms on Trees and Graphs. Springer, 2002.
[29] G. Valiente, “Efficient Algorithms on Trees and Graphs with Unique Node Labels,” Applied Graph Theory in Computer Vision and Pattern Recognition, Studies in Computational Intelligence 52, A.Kandel, H. Bunke, and M. Last, eds., pp. 137-149, Springer, 2007.
[30] L. Wang, K. Zhang, and L. Zhang, “Perfect Phylogenetic Networks with Recombination,” J. Computational Biology, vol. 8, no. 1, pp. 69-78, 2001.
[31] J.D. Watson, T.A. Baker, S.P. Bell, A. Gann, M. Levine, and R. Losick, Molecular Biology of the Gene, sixth ed. Benjamin Cummings, 2008.
[32] S.J. Willson, “Restrictions on Meaningful Phylogenetic Networks,” Contributed Talk at the EMBO Workshop on Current Challenges and Problems in Phylogenetics, Isaac Newton Inst. for Math. Sciences, Cambridge, UK, Sept. 2007.
[33] S.J. Willson, “Reconstruction of Certain Phylogenetic Networks from the Genomes at Their Leaves,” J. Theoretical Biology, vol. 252, pp. 338-349, 2008.
[34] S.M. Woolley, D. Posada, and K.A. Crandall, “A Comparison of Phylogenetic Network Methods Using Computer Simulation,” Plos ONE, vol. 3, no. 4, p. e1913, 2008.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool