This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Unicyclic Networks: Compatibility and Enumeration
January-March 2006 (vol. 3 no. 1)
pp. 84-91
Graphs obtained from a binary leaf labeled ("phylogenetic”) tree by adding an edge so as to introduce a cycle provide a useful representation of hybrid evolution in molecular evolutionary biology. This class of graphs (which we call "unicyclic networks”) also has some attractive combinatorial properties, which we present. We characterize when a set of binary phylogenetic trees is displayed by a unicyclic network in terms of tree rearrangement operations. This leads to a triple-wise compatibility theorem and a simple, fast algorithm to determine 1{\hbox{-}}{\rm cycle} compatibility. We also use generating function techniques to provide closed-form expressions that enumerate unicyclic networks with specified or unspecified cycle length, and we provide an extension to enumerate a class of multicyclic networks.

[1] M.C. Baroni, “Hybrid Phylogenies: A Graph-Based Approach to Represent Reticulate Evolution,” PhD thesis, Univ. of Canterbury, New Zealand, 2004.
[2] M.C. Baroni, C. Semple, and M. Steel, “A Framework for Representing Reticulate Evolution,” Annals of Combinatorics, vol. 8, pp. 391-408, 2004.
[3] M. Carter, M.D. Hendy, D. Penny, L.A. Székely, and N.C. Wormald, “On the Distribution of Lengths of Evolutionary Trees,” SIAM J. Discrete Math., vol. 3, pp. 38-47, 1990.
[4] J. Felsenstein, Inferring Phylogenies. Sinauer Press, 2004.
[5] I.P. Goulden and D.M. Jackson, Combinatorial Enumeration. New York: John Wiley and Sons, 1983.
[6] D. Gusfield, S. Eddhu, C. Langley, “Optimal, Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination,” J. Bioinformatics and Computational Biology, vol. 2, pp. 173-213, 2004.
[7] B. Holland, K. Huber, V. Moulton, and P.J. Lockhart, “Using Consensus Networks to Visualize Contradictory Evidence for Species Phylogeny,” Soc. Molecular Biology and Evolution, vol. 21, pp. 1459-1461, 2004.
[8] D.H. Huson, T. Dezulian, T. Kloepper, and M.A. Steel, “Phylogenetic Super-Networks from Partial Trees,” IEEE Trans. Computational Biology and Bioinformatics, vol. 1, no. 4, pp. 151-158, Oct. 2004.
[9] D.H. Huson, T. Kloepper, P.J. Lockhart, and M.A. Steel, “Reconstruction of Reticulate Networks from Gene Trees,” Proc. Int'l Conf. Research in Computational Molecular Biology (RECOMB), pp. 233-249, 2005.
[10] T.N.D. Huydn, J. Jansson, N.B. Nguyen, and W.-K. Sung, “Constructing a Smallest Refinining Galled Phylogenetic Network,” Proc. Int'l Conf. Research in Computational Molecular Biology (RECOMB), pp. 265-280, 2005.
[11] J. Jansson and W-K. Sung, “The Maximum Agreement of Two Nested Phylogenetic Networks,” Proc. Int'l Symp. Algorithms and Computation (ISAAC), pp. 581-593, 2004.
[12] P. Legendre, “Biological Applications of Reticulate Analysis,” J. Classification, vol. 17, pp. 191-195, 2000.
[13] J.O. McInerney and M. Wilkinson, “New Methods Ring Changes for the Tree of Life,” Trends in Ecology and Evolution, vol. 20, pp. 105-107, 2005.
[14] J. Mallet, “Hybridization as an Invasion of the Genome,” Trends in Ecology and Evolution, vol. 20, pp. 229-237, 2005.
[15] 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. 1-11, Jan. 2004.
[16] L. Nakhleh, T. Warnow, and C. Randal-Linder, “Reconstructing Reticulate Evolution in Species— Theory and Practice,” Proc. Eighth Ann. Int'l Conf. Research in Computational Molecular Biology (RECOMB), pp. 337-346, 2004.
[17] M.C. Rivera and J.C. Lake, “The Ring of Life Provides Evidence for a Genome Fusion Origin of Eukaryotes,” Nature, vol. 431, pp. 152–155, 2004.
[18] F.J. Rohlf, “Phylogenetic Models and Reticulations,” J. Classification, vol. 17, pp. 185-189, 2000.
[19] E. Schröder, “Vier Combinatorische Probleme,” Zeitschrift für Mathematik und Physik, vol. 15, pp. 361-376, 1870.
[20] C. Semple and M. Steel, Phylogenetics. Oxford Univ. Press, 2003.
[21] C. Semple and M. Steel, “Cyclic Permutations and Evolutionary Trees,” Advances in Applied Math., vol. 32, pp. 669-680, 2004.
[22] Y. Song and J. Hein, “On the Minimum Number of Recombination Events in the Evolutionary History of DNA Sequences,” J. Math. Biology, vol. 48, pp. 160–186, 2003.
[23] L. Wang, K. Zhang, and L. Zhang, “Perfect Phylogenetic Networks with Recombination,” J. Computational Biology, vol. 8, pp. 69-78, 2001.

Index Terms:
Phylogenetic tree, compatibility, circular orderings, generating function, galled-trees.
Citation:
Charles Semple, Mike Steel, "Unicyclic Networks: Compatibility and Enumeration," IEEE/ACM Transactions on Computational Biology and Bioinformatics, vol. 3, no. 1, pp. 84-91, Jan.-March 2006, doi:10.1109/TCBB.2006.14
Usage of this product signifies your acceptance of the Terms of Use.