[1] E. N., Adams III. Consensus techniques and the comparison of phylogenetic trees. Systematic Zoology, 21(4):390–397, 1972.Google Scholar

[2] E. N., Adams III. N-trees as nesttings: complexity, similarity, and consensus. Journal of Classification, 3:299–317, 1986.Google Scholar

[3] A. V., Aho, Y., Sagiv, T. G., Szymanski, and J. D., Ullman. Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions. SIAM Journal on Computing, 10(3):405–421, 1981.Google Scholar

[4] M., Arenas and D., Posada. Recodon: coalescent simulation of coding DNA sequences with recombination, migration and demography. BMC Bioinformatics, 8:458, 2007.Google Scholar

[5] S. C., Ayling and T. A., Brown. Novel methodology for construction and pruning of quasi-median networks. BMC Bioinformatics, 9:115, 2008.Google Scholar

[6] H. -J., Bandelt. Generating median graphs from boolean matrices. In Y., Dodge, ed., L1-Statistical Analysis, pp. 305–309. North-Holland, 1992.Google Scholar

[7] H. -J., Bandelt. Phylogenetic networks. Verhandl. Naturwiss. Vereins Hamburg (NF), 34:51–71, 1994.Google Scholar

[8] H. -J., Bandelt and A., Dress. A relational approach to split decomposition. In O., Opitz, B., Lausen, and R., Klar, eds., Information and Classification, pp. 123–131. Springer, 1993.Google Scholar

[9] H. -J., Bandelt and A. W. M., Dress. A canonical decomposition theory for metrics on a finite set. Advances in Mathematics, 92:47–105, 1992.Google Scholar

[10] H. -J., Bandelt, P., Forster, and A., Röhl. Median-joining networks for inferring intraspecific phylogenies. Molecular Biology and Evolution, 16:37–48, 1999.Google Scholar

[11] H. J., Bandelt, P., Forster, B. C., Sykes, and M. B., Richards. Mitochondrial portraits of human population using median networks. Genetics, 141(2):743–753, 1995.Google Scholar

[12] H. -J., Bandelt, V., Macaulay, and M., Richards. Median networks: speedy construction and greedy reduction, one simulation, and two case studies from human mtDNA. Molecular Phylogenetics and Evolution, 16(1):8–28, 2000.Google Scholar

[13] E., Bapteste, M., O'Malley, R., Beiko, et al. Prokaryotic evolution and the tree of life are two different things. Biology Direct, 4(1):34, 2009.Google Scholar

[14] A., Barbrook, C., Howe, and N., Blake. The phylogeny of the Canterbury tales. Nature, 394:839, 1998.Google Scholar

[15] M., Baroni, S., Grüenewald, V., Moulton, and C., Semple. Bounding the number of hybridization events for a consistent evolutionary history. Mathematical Biology, 51:171–182, 2005.Google Scholar

[16] M., Baroni, C., Semple, and M., Steel. Hybrids in real time. Systematic Biology, 55(1):46–56, 2006.Google Scholar

[17] J. -P., Barthélemy and A., Guénoche. Trees and Proximity Representations. Wiley, 1991.Google Scholar

[18] R., Beiko and N., Hamilton. Phylogenetic identification of lateral genetic transfer events. BMC Evolutionary Biology, 6(1):15, 2006.Google Scholar

[19] C., Berthouly, G., Leroy, T. N., Van, et al. Genetic analysis of local Vietnamese chickens provides evidence of gene flow from wild to domestic populations. BMC Genetics, 10(1):1, 2009.Google Scholar

[20] J., Bohne, A. W. M., Dress, and S., Fischer. A simple proof for de Bruijn's dualization principle. Sankhya. Series A, 54(Special Issue):77–84, 1992.Google Scholar

[21] S., Bokhari and D., Janies. Reassortment networks for investigating the evolution of segmented viruses. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 99(RapidPosts), 2008.Google Scholar

[22] T., Bonfert, R., Rupp, and D. H., Huson. Phylogenetic networks from multi-labeled trees. Poster presented at German Conference on Bioinformatics, Halle (Saale), 2009.

[23] K. S., Booth and G. S., Luecker. Testing for the consecutive ones property, interval graphs and graph planarity using pq-tree algorithms. Journal of Computer and System Sciences, 13:335–379, 1976.Google Scholar

[24] M., Bordewich, S., Linz, K. St., John, and C., Semple. A reduction algorithm for computing the hybridization number of two trees. Evolutionary Bioinformatics, 3:86–98, 2007.Google Scholar

[25] M., Bordewich and C., Semple. On the computational complexity of the rooted subtree prune and regraft distance. Annals of Combinatorics, 8(4):409–423, 2005.Google Scholar

[26] M., Bordewich and C., Semple. Computing the hybridization number of two phylogenetic trees is fixed-parameter tractable. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 4(3):458–466, 2007.Google Scholar

[27] M., Bordewich and C., Semple. Computing the minimum number of hybridisation events for a consistent evolutionary history. Discrete Applied Mathematics, 155(8):914–928, 2007.Google Scholar

[28] L., Boto. Horizontal gene transfer in evolution: facts and challenges. Proceedings of the Royal Society B: Biological Sciences, 277(1683):819–827, 2010.Google Scholar

[29] N. G., de Bruijn. Dualization of multigrids. Journal de Physique, 47(7 Suppl. Colloq. C3):C3–9–C3–18, 1986.Google Scholar

[30] D., Bryant. Hunting for trees, building trees and comparing trees: theory and method in phylogenetic analysis. PhD thesis, Department of Mathematics, University of Canterbury, 1997.

[31] D., Bryant and V., Moulton. Neighbor Net: an agglomerative method for the construction of planar phylogenetic networks. In R., Guig and D., Gusfield, eds., Algorithms in Bioinformatics: Proceedings of the Second International Workshop on Algorithms in Bioinformatics (WABI), vol. 2452 of LNCS, pp. 375–391, 2002.Google Scholar

[32] D., Bryant and V., Moulton. Neighbor-Net: an agglomerative method for the construction of phylogenetic networks. Molecular Biology and Evolution, 21(2):255–265, 2004.Google Scholar

[33] D., Bryant, V., Moulton, and A., Spillner. Consistency of the Neighbor-Net algorithm. Algorithms for Molecular Biology, 2(1):8, 2007.Google Scholar

[34] A., Brysting, B., Oxelman, K., Huber, V., Moulton, and C., Brochmann. Untangling complex histories of genome mergings in high polyploids. Systematic Biology, 56(3):467–476, 2007.Google Scholar

[35] P., Buendia and G., Narasimhan. Serial NetEvolve: a flexible utility for generating seriallysampled sequences along a tree or recombinant network. Bioinformatics, 22(18):2313–2314, 2006.Google Scholar

[36] P., Buendia and G., Narasimhan. Sliding MinPD: building evolutionary networks of serial samples via an automated recombination detection approach. Bioinformatics, 23(22):2993–3000, 2007.Google Scholar

[37] P., Buneman. The recovery of trees from measures of dissimilarity. In F. R., Hodson, D. G., Kendall, and P., Tautu, eds., Mathematics in the Archaeological and Historical Sciences, pp. 387–395. Edinburgh University Press, 1971.Google Scholar

[38] G., Cardona, M., Llabrés, F., Rosselló, and G., Valiente. A distance metric for a class of tree-sibling phylogenetic networks. Bioinformatics, 24(13):1481–1488, 2008.Google Scholar

[39] G., Cardona, M., Llabrés, F., Rosselló, and G., Valiente. Metrics for phylogenetic networks I: generalizations of the Robinson-Foulds metric. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6(1):46–61, 2009.Google Scholar

[40] G., Cardona, M., Llabrés, F., Rosselló, and G., Valiente. On Nakhleh's metric for reduced phylogenetic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6(4):629–638, 2009.Google Scholar

[41] G., Cardona, F., Rosselló, and G., Valiente. Comparison of tree-child phylogenetic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6:552–569, 2007.Google Scholar

[42] G., Cardona, F., Rosselló, and G., Valiente. A Perl package and an alignment tool for phylogenetic networks. BMC Bioinformatics, 9:175, 2008.Google Scholar

[43] G., Cardona, F., Rosselló, and G., Valiente. Extended Newick: it is time for a standard representation of phylogenetic networks. BMC Bioinformatics, 9:532, 2008.Google Scholar

[44] F., Casado, C. R., Bonvicino, and H. N., Seuanez. Phylogeographic analyses of Callicebus lugens (Platyrrhini, Primates). Journal of Heredity, 98(1):88–92, 2007.Google Scholar

[45] I., Cassens, P., Mardulyn, and M. C., Milinkovitch. Evaluating intraspecific “network” construction methods using simulated sequence data: do existing algorithms outperform the global maximum parsimony approach? Systematic Biology, 54(3):363–372, 2005.Google Scholar

[46] J., Castresana. Selection of conserved blocks from multiple alignments for their use in phylogenetic analysis. Molecular Biology and Evolution, 17(4):540–552, 2000.Google Scholar

[47] M., Castrucci, I., Donatelli, L., Sidoli, et al. Genetic reassortment between avian and human influenza A viruses in Italian pigs. Virology, 193(1):503–506, 1993.Google Scholar

[48] M. A., Charleston. Jungles: a new solution to the host/parasite phylogeny reconciliation problem. Mathematical Biosciences, 149:191–223, 1998.Google Scholar

[49] K., Chen, D., Durand, and M., Farach-Colton. Notung: dating gene duplications using gene family trees. Journal of Computational Biology, 7(3):429–447, 2000.Google Scholar

[50] B., Chor and T., Tuller. Finding a maximum likelihood tree is hard. Journal of the ACM, 53(5):722–744, 2006.Google Scholar

[51] C., Choy, J., Jansson, K., Sadakane, and W. -K., Sung. Computing the maximum agreement of phylogenetic networks. Theoretical Computer Science, 335(1):93–107, 2005.Google Scholar

[52] M., Clement, D., Posada, and K. A., Crandall. TCS: a computer program to estimate gene genealogies. Molecular Ecology, 9:1657–1659, 2000.Google Scholar

[53] J., Cohen. Mathematics is biology's next microscope, only better; biology is mathematics' next physics, only better. PLoS Biology, 2(12):e439, 2004.Google Scholar

[54] L. A., David and E. J., Alm. Insights into the origins of microbial gene families. In press. Software: AnGST, 2010.Google Scholar

[55] C., Delwiche. Tracing the thread of plastid diversity through the tapestry of life. American Naturalist, 154:s164–S177, 1999.Google Scholar

[56] C. F., Delwiche and J. D., Palmer. Rampant horizontal transfer and duplication of rubisco genes in eubacteria and plastids. Molecular Biology and Evolution, 13:873–882, 1996.Google Scholar

[57] R., Desper and O., Gascuel. Fast and accurate phylogeny reconstruction algorithms based on the minimum-evolution principle. Journal of Computational Biology, 9(5):687–705, 2002.Google Scholar

[58] R., Desper and O., Gascuel. Theoretical foundation of the balanced minimum evolution method of phylogenetic inference and its relationship to weighted least-squares tree fitting. Molecular Biology and Evolution, 21(3):587–598, 2004.Google Scholar

[59] C., Dessimoz, D., Margadant, and G. H., Gonnet. DLIGHT: lateral gene transfer detection using pairwise evolutionary distances in a statistical framework. In Research in Computational Molecular Biology: Proceedings of the 12th International Conference on Research in Computational Molecular Biology (RECOMB), vol. 4955, LNCS, pp. 315–330. Springer, 2008.Google Scholar

[60] T., Disotell. Discovering human history from stomach bacteria. Genome Biology, 4(5):213, 2003.Google Scholar

[61] W. F., Doolittle. Phylogenetic classification and the Universal Tree. Science, 284:2124–2128, 1999.Google Scholar

[62]A. W. M., Dress and D. H., Huson. Constructing splits graphs. IEEE/ACM Transactions in Computational Biology and Bioinformatics, 1(3):109–115, 2004.Google Scholar

[63] A. W. M., Dress, V., Moulton, and W., Terhalle. T-theory: an overview. European Journal of Combinatorics, 17(2-3):161–175, 1996.Google Scholar

[64] R., Durbin, S. R., Eddy, A., Krogh, and G., Mitchison. Biological Sequence Analysis. Cambridge University Press, 1998.Google Scholar

[65] I., Ebersberger, P., Galgoczy, S., Taudien, et al. Mapping human genetic ancestry. Molecular Biology and Evolution, 24(10):2266–2276, 2007.Google Scholar

[66] R. C., Edgar. MUSCLE: multiple sequence alignment with high accuracy and high throughput. Nucleic Acids Research, 32(5):1792–97, 2004.Google Scholar

[67] A. W. F., Edwards and L. L., Cavalli-Sforza. The reconstruction of evolution. Annals of Human Genetics, 27:105–106, 1963.Google Scholar

[68] A. W. F., Edwards and L. L., Cavalli-Sforza. Reconstruction of evolutionary trees. In V. H., Heywood and J., McNeill, eds., Phenetic and Phylogenetic Classification, vol. 6, pp. 67–76. Systematics Association, London, 1964.Google Scholar

[69] J., Escobar, A., Cenci, C., Scornavacca, et al. Combining supermatrix and supertree in Triticeea (Poaceae). Unpublished manuscript, 2010.

[70] G. F., Estabrook, F. R., McMorris, and C. A., Meacham. Comparison of undirected phylogenetic trees based on subtrees of four evolutionary units. Systematic Zoology, 34(2):193–200, 1985.Google Scholar

[71] L., Excoffier, G., Laval, and S., Schneider. Arlequin ver. 3.0: an integrated software package for population genetics data analysis. Evolutionary Bioinformatics Online, 1:47–50, 2005.Google Scholar

[72] L., Excoffier and P., Smouse. Using allele frequencies and geographic subdivision to reconstruct gene trees within a species: molecular variance parsimony. Genetics, 136:343–359, Jan. 1994.Google Scholar

[73] J., Felsenstein. Evolutionary trees from DNA sequences: a maximum likelihood approach. Journal of Molecular Evolution, 17(6):368–376, 1981.Google Scholar

[74] J., Felsenstein. Statistical inference of phylogenies (with discussion). Journal of the Royal Statistical Society: Series A (Statistics in Society), 146:246–272, 1983.Google Scholar

[75] J., Felsenstein. PHYLIP: phylogeny inference package (version 3.2). Cladistics, 5:164–166, 1989.Google Scholar

[76] J., Felsenstein. An alternating least squares approach to inferring phylogenies from pairwise distances. Systematic Biology, 46(1):101–111, March 1997.Google Scholar

[77] J., Felsenstein. Inferring Phylogenies. Sinauer Associates, Inc., 2004.Google Scholar

[78] J., Felsenstein and G. A., Churchill. A hidden Markov model approach to variation among sites in rate of evolution. Molecular Biology and Evolution, 13(1):93–104, 1996.Google Scholar

[79] W. M., Fitch. Toward defining the course of evolution: minimum change for a specified tree topology. Systematic Zoology, 20:406–416, 1971.Google Scholar

[80] W. M., Fitch. Networks and viral evolution. Journal of Molecular Evolution, 44:65–75, 1997.Google Scholar

[81] W. M., Fitch and E., Margoliash. Construction of phylogenetic trees. Science, 155(3760):279–284, 1967.Google Scholar

[82] P., Gambette and D. H., Huson. Improved layout of phylogenetic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 5(3):472–479, 2008.Google Scholar

[83] M. R., Garey and D. S., Johnson. Computers and intractability, a guide to the theory of NP-completeness. Bell Telephone Laboratories, Inc., 1979.Google Scholar

[84] O., Gascuel and M., Steel. Neighbor-joining revealed. Molecular Biology and Evolution, 23(11):1997–2000, 2006.Google Scholar

[85] D., Gömöry and L., Paule. Reticulate evolution patterns in western-Eurasian beeches. Botanica Helvetica, 2010.Google Scholar

[86] P., Górecki. Reconciliation problems for duplication, loss and horizontal gene transfer. In Proceedings of the Eighth Annual Internation Conference on Research in Computational Molecular Biology (RECOMB), pp. 316–325. ACM Press, 2004.Google Scholar

[87] ,Grass Phylogeny Working Group. Phylogeny and subfamilial classification of the grasses (Poaceae). Annals of the Missouri Botanical Garden, 88(3):373–457, 2001.CrossRefGoogle Scholar

[88] P. J., Green. Reversible jump Markov Chain Monte Carlo computation and Bayesian model determination. Biometrika, 82(4):711–732, 1995.Google Scholar

[89] R. C., Griffiths and P., Marjoram. Ancestral inference from samples of DNA sequences with recombination. Journal of Computational Biology, 3:479–502, 1996.Google Scholar

[90] R. C., Griffiths and P., Marjoram. An ancestral recombination graph. In P., Donnelly and S., Tavaré, eds., Progress in Population Genetics and Human Evolution, vol. 87, IMA Volumes of Mathematics and its Applications, pp. 257–270. Springer, 1997.Google Scholar

[91] S., Grünewald, K. F., amdA. W. M., Dress, and V., Moulton. QNet: an agglomerative method for the construction of phylogenetic networks from weighted quartets. Molecular Biology and Evolution, 24(2):532–538, 2007.Google Scholar

[92] S., Grünewald, K. T., Huber, and Q., Wu. Novel closure rules for constructing phylogenetic super-networks. Bulletin of Mathematical Biology, 70:1906–1924, 2008.Google Scholar

[93] S., Grünewald, V., Moulton, and A., Spillner. Consistency of the QNet algorithm for generating planar split networks from weighted quartets. Discrete Applied Mathematics, 157(10):2325–2334, 2009.Google Scholar

[94] S., Grünewald, M. A., Steel, and M. S., Swenson. Closure operations in phylogenetics. Mathematical Biosciences, 208(2):521–537, 2007.Google Scholar

[95] D., Gusfield. Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination. Journal of Computer and System Sciences, 70:381–398, 2005.Google Scholar

[96] D., Gusfield and V., Bansal. A fundamental decomposition theory for phylogenetic networks and incompatible characters. In Research in Computational Molecular Biology: Proceedings of the Ninth International Conference on Research in Computational Molecular Biology (RECOMB), vol. 3500 of LNCS, pp. 217–232. Springer, 2005.Google Scholar

[97] D., Gusfield, V., Bansal, V., Bafna, and Y. S., Song. A decomposition theory for phylogenetic networks and incompatible characters. Journal of Computational Biology, 14(10):1247–1272, 2007.Google Scholar

[98] D., Gusfield, S., Eddhu, and C., Langley. Efficient reconstruction of phylogenetic networks with constrained recombinations. In Proceedings of the IEEE Computer Society Conference on Bioinformatics (CSB), p. 363. IEEE Computer Society, 2003.Google Scholar

[99] D., Gusfield, S., Eddhu, and C., Langley. Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. Journal of Bioinformatics and Computational Biology, 2(1):173–213, 2004.Google Scholar

[100] M., Hallett, J., Largergren, and A., Tofigh. Simultaneous identification of duplications and lateral transfers. In Proceedings of the Eight International Conference on Research in Computational Molecular Biology (RECOMB), pp. 347–356. ACM Press, 2004.Google Scholar

[101] J. A., Hartigan. Minimum mutation fits to a given tree. Biometrics, 29(1):53–65, 1973.Google Scholar

[102] D. L., Hartl and A. G., Clark. Principles of Population Genetics, Fourth Edition. Sinauer Associates, Inc., 2006.Google Scholar

[103] M., Hasegawa, H., Kishino, and T., Yano. Dating of the human-ape splitting by a molecular clock of mitochondrial DNA. Journal of Molecular Evolution, 22(2):160–174, 1985.Google Scholar

[104] W. K., Hastings. Monte Carlo sampling methods using Markov chains and their applications. Biometrika, 57:97–109, 1970.Google Scholar

[105] J., Hein. Reconstructing evolution of sequences subject to recombination using parsimony. Mathematical Biosciences, 98(2):185–200, 1990.Google Scholar

[106] J., Hein. A heuristic method to reconstruct the history of sequences subject to recombination. Journal of Molecular Evolution, 36:396–405, 1993.Google Scholar

[107] J., Hein, T., Jiang, L., Wang, and K., Zhang. On the complexity of comparing evolutionary trees. Discrete Applied Mathematics, 71(1–3):153–169, 1996.Google Scholar

[108] J., Hein, M. H., Schierup, and C., Wiuf. Gene Genealogies, Variation and Evolution: A Primer in Coalescent Theory. Oxford University Press, February 2005.Google Scholar

[109] M. D., Hendy and D., Penny. Branch and bound algorithms to determine minimal evolutionary trees. Mathematical Biosciences, 59(2):277–290, 1982.Google Scholar

[110] J. G., Henikoff and S., Henikoff. Blocks database and its applications. Methods in Enzymology, 266:88–105, 1996.Google Scholar

[111] E., Hilario and J. P., Gogarten. Horizontal transfer of ATPase genes: the tree of life becomes a net of life. Biosystems, 31:111–119, 1993.Google Scholar

[112] B., Holland, K., Huber, V., Moulton, and P. J., Lockhart. Using consensus networks to visualize contradictory evidence for species phylogeny. Molecular Biology and Evolution, 21:1459–1461, 2004.Google Scholar

[113] B., Holland and V., Moulton. Consensus networks: a method for visualizing incompatibilities in collections of trees. In G., Benson and R., Page, eds., Workshop on Algorithms in Bioinformatics (WABI), vol. 2812, pp. 165–176. Springer, 2003.Google Scholar

[114] E. C., Holmes, M., Worobey, and A., Rambaut. Phylogenetic evidence for recombination in dengue virus. Molecular Biology and Evolution, 16:405–409, 1999.Google Scholar

[115] K., Huber, L., van Iersel, S., Kelk, and R., Suchecki. A practical algorithm for reconstructing level-1 phylogenetic networks. In IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2010.Google Scholar

[116] K. T., Huber, M., Langton, D., Penny, V., Moulton, and M., Hendy. Spectronet: a package for computing spectra and median networks. Applied Bioinformatics, 1:159–161, 2002.Google Scholar

[117] K. T., Huber, B., Oxelman, M., Lott, and V., Moulton. Reconstructing the evolutionary history of polyploids from multilabeled trees. Molecular Biology and Evolution, 23(9):1784–1791, 2006.Google Scholar

[118] R. R., Hudson and N. L., Kaplan. Statistical properties of the number of recombination events in the history of a sample of DNA sequences. Genetics, 111:147–164, 1985.Google Scholar

[119] J. P., Huelsenbeck, F., Ronquist, R., Nielsen, and J. P., Bollback. Bayesian inference of phylogeny and its impact on evolutionary biology. Science, 294:2310–2314, 2001.Google Scholar

[120] D., Huson and C., Scornavacca. Dendroscope 2: a program for computing and drawing rooted phylogenetic trees and networks. In preparation, software available from: www.dendroscope.org, 2011.

[121] D., Huson and R., Rupp. Summarizing multiple gene trees using cluster networks. In Algorithms in Bioinformatics: Proceedings of the Eighth International Workshop on Algorithms in Bioinformaticsy (WABI), vol. 5251, LNBI, pp. 211–225, 2008.Google Scholar

[122] D. H., Huson. Splits Tree: analyzing and visualizing evolutionary data. Bioinformatics, 14(10):68–73, 1998.Google Scholar

[123] D. H., Huson. Split networks and reticulate networks. In O., Gascuel and M. A., Steel, eds., Reconstructing Evolution: New Mathematical and Computational Advances, pp. 247–276. Oxford University Press, 2007.Google Scholar

[124] D. H., Huson. Drawing rooted phylogenetic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 6(1):103–109, 2009.Google Scholar

[125] D. H., Huson and D., Bryant. Application of phylogenetic networks in evolutionary studies. Molecular Biology and Evolution, 23:254–267, 2006.Google Scholar

[126] D. H., Huson, T., Dezulian, T., Kloepper, and M. A., Steel. Phylogenetic super-networks from partial trees. IEEE/ACM Transactions in Computational Biology and Bioinformatics, 1(4):151–158, 2004.Google Scholar

[127] D. H., Huson, T., Kloepper, P. J., Lockhart, and M. A., Steel. Reconstruction of reticulate networks from gene trees. In Research in Computational Molecular Biology: Proceedings of the Ninth International Conference on Research in Computational Molecular Biology (RECOMB), vol. 3500, LNCS, pp. 233–249. Springer, 2005.Google Scholar

[128] D. H., Huson and T. H., Klöpper. Computing recombination networks from binary sequences. Bioinformatics, 21(suppl. 2):ii159–ii165, 2005.Google Scholar

[129] D. H., Huson and T. H., Klöpper. Beyond galled trees: decomposition and computation of galled networks. In Research in Computational Molecular Biology: Proceedings of the 11th International Conference on Research in Computational Molecular Biology (RECOMB), vol. 4453 of LNCS, pp. 211–225. Springer, 2007.Google Scholar

[130] D. H., Huson, D. C., Richter, C., Rausch, et al. Dendroscope: an interactive viewer for large phylogenetic trees. BMC Bioinformatics, 8(1):460, 2007.Google Scholar

[131] D. H., Huson, R., Rupp, V., Berry, P., Gambette, and C., Paul. Computing galled networks from real data. Bioinformatics, 25(12):i85–i93, 2009.Google Scholar

[132] D. H., Huson, M. A., Steel, and J., Whitfield. Reducing distortion in phylogenetic networks. In P., Bücher and B. M. E., Moret, editors, Algorithms in Bioinformatics. Proceedings of the 6th International Workshop on Algorithms in Bioinformatics (WABI), vol. 4175, LNBI, pp. 150–161. Springer, 2006.Google Scholar

[133] L., van Iersel, J., Keijsper, S., Kelk, L., Stougie, F., Hagen, and T., Boekhout. Constructing level-2 phylogenetic networks from triplets. In Research in Computational Molecular Biology: Proceedings of the 12th International Conference on Research in Computational Molecular Biology (RECOMB), vol. 4955, LNCS, pp. 450–462. Springer, 2008.Google Scholar

[134] L., van Iersel and S., Kelk. Constructing the simplest possible phylogenetic network from triplets. Algorithmica, 2009. DOI 10.1007/s00453-009-9333-0.

[135] L., van Iersel and S., Kelk. When two trees go to war. In preparation, 2011.

[136] L., van Iersel, S., Kelk, R., Rupp, and D., Huson. Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters. Bioinformatics, 26(12):i124–131, 2010.Google Scholar

[137] J., Isbell. Six theorems about injective metric spaces. Commentarii Mathematici Helvetici, 39(1):65–76, 1964.Google Scholar

[138] J., Jansson. On the complexity of inferring rooted evolutionary trees. Electronic Notes in Discrete Mathematics, 7:50–53, 2001.Google Scholar

[139] J., Jansson, N. B., Nguyen, and W.-K., Sung. Algorithms for combining rooted triplets into a galled phylogenetic network. SIAM Journal on Computing, 35(5):1098–1121, 2006.Google Scholar

[140] J., Jansson and W.-K., Sung. Inferring a level-1 phylogenetic network from a dense set of rooted triplets. In Computing and Combinatorics: Proceedings of the 10th Annual International Conference on Computing and Combinatorics (COCOON), vol. 3106, LNCS, pp. 462–471. Springer, 2004.Google Scholar

[141] G., Jin, L., Nakhleh, S., Snir, and T., Tuller. Efficient parsimony-based methods for phylogenetic network reconstruction. In Proceedings of the European Conference on Computational Biology (ECCB), vol. 23, Bioinformatics, pp. e123–e128, 2006.Google Scholar

[142] G., Jin, L., Nakhleh, S., Snir, and T., Tuller. Maximum likelihood of phylogenetic networks. Bioinformatics, 22(21):2604–2611, 2006.Google Scholar

[143] G., Jin, L., Nakhleh, S., Snir, and T., Tuller. Inferring phylogenetic networks by the maximum parsimony criterion: a case study. Molecular Biology and Evolution, 24(1):324–337, 2007.Google Scholar

[144] T. H., Jukes and C. R., Cantor. Evolution of protein molecules. In H. N., Munro, ed., Mammalian Protein Metabolism, pages 21–132. Academic Press, 1969.Google Scholar

[145] I. A., Kanj, L., Nakhleh, C., Than, and G., Xia. Seeing the trees and their branches in the network is hard. Theoretical Computer Science, 401(1–3):153–164, 2008.Google Scholar

[146] R. M., Karp. Reducibility among combinatorial problems. In R. E., Miller and J. W., Thatcher, eds., Complexity of Computer Computations, pp. 85–103. Plenum Press, 1972.Google Scholar

[147] L., Kils-Hutten, R., Cheynier, S., Wain-Hobson, and A., Meyerhans. Phylogenetic reconstruction of intrapatient evolution of human immunodeficiency virus type 1: predominance of drift and purifying selection. Journal of General Virology, 82(7):1621–1627, 2001.Google Scholar

[148] M., Kimura. A simple method for estimating evolutionary rates of base substitutions through comparative studies of nucleotide sequences. Journal of Molecular Evolution, 16(2):111–120, 1980.Google Scholar

[149] M., Kimura. Estimation of evolutionary distances between homologous nucleotide sequences. Proceedings of the National Academy of Sciences USA, 78(1):454–458, 1981.Google Scholar

[150] M., Kimura and J., Crow. The number of alleles that can be maintained in a finite population. Genetics, 49:725–738, 1964.Google Scholar

[151] T., Kivisild, M., Bamshad, K., Kaldma, et al. Deep common ancestry of Indian and western Eurasian mtDNA lineages. Current Biology, 9:1331–1334, 1999.Google Scholar

[152] T., Klöpper. Algorithms for the calculation and visualization of phylogenetic networks. PhD thesis, Center for Bioinformatics, University of Tübingen, 2008.

[153] S., Koblmuller, N., Duftner, K., Sefc, et al. Reticulate phylogeny of gastropod-shell-breeding cichlids from Lake Tanganyika: the result of repeated introgressive hybridization. BMC Evolutionary Biology, 7(1):7, 2007.Google Scholar

[154] M. A., Koch, C., Dobes, C., Kiefer, et al. Supernetwork identifies multiple events of plastid trnF(GAA) pseudogene evolution in the Brassicaceae. Molecular Biology and Evolution, 24(1):63–73, 2007.Google Scholar

[155] J., Kruskal. On the shortest spanning tree of a graph and the traveling salesman problem. Proceedings of the American Mathematical Society, 7:48–50, 1956.Google Scholar

[156] H. W., Kuhn. The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2:83–97, 1955.Google Scholar

[157] V., Kunin, L., Goldovsky, N., Darzentas, and C. A., Ouzounis. The net of life: reconstructing the microbial phylogenetic network. Genome Research, 15(7):954–959, 2005.Google Scholar

[158] C., Lanave, G., Preparata, C., Saccone, and G., Serio. A new method for calculating evolutionary substitution rates. Journal of Molecular Evolution, 20(1):86–93, 1984.Google Scholar

[159] R., Lapointe, K., Tanaka, W. E., Barney, et al. Genomic and morphological features of a banchine polydnavirus: comparison with bracoviruses and ichnoviruses. Journal of Virology, 81(12):6491–6501, 2007.Google Scholar

[160] B., Larget and D. L., Simon. Markov Chain Monte Carlo algorithms for the Bayesian analysis of phylogenetic trees. Molecular Biology and Evolution, 16(6):750–759, Jul. 1999.Google Scholar

[161] J., Leebens-Mack, L. A., Raubeson, L., Cui, et al. Identifying the basal angiosperm node in chloroplast genome phylogenies: sampling one's way out of the Felsenstein Zone. Molecular Biology and Evolution, 22(10):1948–1963, 2005.Google Scholar

[162] P., Legendre and V., Makarenkov. Reconstruction of biogeographic and evolutionary networks using reticulograms. Systematic Biology, 51(2):199–216, 2002.Google Scholar

[163] P., Lemey, M., Salemi, and A.-M., Vandamme, eds. The Phylogenetic Hand book, 2nd ed. Cambridge University Press, 2009.

[164] T., Lengauer and R. E., Tarjan. A fast algorithm for finding dominators in a flowgraph. ACM Transactions on Programming Languages and Systems, 1(1):121–141, 1979.Google Scholar

[165] C. R., Linder and L. H., Rieseberg. Reconstructing patterns of reticulate evolution in plants. American Journal of Botany, 91:1700–1708, 2004.Google Scholar

[166] S., Linz and C., Semple. A cluster reduction for computing the subtree distance between phylogenies. Annals of Combinatorics, in press, 2010.Google Scholar

[167] M., Lott, A., Spillner, K. T., Huber, and V., Moulton. Padre: a package for analyzing and displaying reticulate evolution. Bioinformatics, 25(9):1199–1200, 2009.Google Scholar

[168] E., Luks. Isomorphism of graphs of bounded valence can be tested in polynomial time. Journal of Computer and System Sciences, 25:42–65, 1982.Google Scholar

[169] R. B., Lyngso and Y. S., Song. Minimum recombination histories by branch and bound. In Algorithms in Bioinformatics: Proceedings of the Fifth International Workshop on Algorithms in Bioinformaticsy (WABI), vol. 3692, LNBI, pp. 239–250. Springer, 2005.Google Scholar

[170] D. R., Maddison, D. L., Swofford, and W. P., Maddison. NEXUS: an extendible file format for systematic information. Systematic Biology, 46(4):590–621, 1997.Google Scholar

[171] V., Makarenkov. T-REX: reconstructing and visualizing phylogenetic trees and reticulation networks. Bioinformatics, 17(7):664–668, 2001.Google Scholar

[172] V., Makarenkov and P., Legendre. From a phylogenetic tree to a reticulated network. Journal of Computational Biology, 11(1):195–212, 2004.Google Scholar

[173] W., Martin. Mosaic bacterial chromosomes: a challenge en route to a tree of genomes. Bioessays, 21(2):99–104, 1999.Google Scholar

[174] C. A., Meacham. Theoretical and computational considerations of the compatibility of qualitative taxonomic characters. In J., Felsenstein, ed., Numerical Taxonomy, vol. G1. Springer, 1983.Google Scholar

[175] N., Metropolis, A. W., Rosenbluth, M. N., Rosenbluth, A. H., Teller, and E., Teller. Equation of state calculations by fast computing machines. Journal of Chemical Physics, 21(6):1087–1092, 1953.Google Scholar

[176] C. M., Miller-Butterworth, D. S., Jacobs, and E. H., Harley. Strong population substructure is correlated with morphology and ecology in a migratory bat. Nature, 424(6945):187–191, July 2003.Google Scholar

[177] S., Mitra, J. A., Gilbert, D., Field, and D. H., Huson. Comparison of multiple metagenomes using phylogenetic networks based on ecological indices. ISME Journal, doi:10.1038/ismej. 2010. 51, 2010 (see http://www.nature.com/ismej/journal/vaop/ncurrent/abs/ismej201051a.html).

[178] G., Moore, M., Goodman, and J., Barnabas. An iterative approach from the standpoint of the additive hypothesis to the dendrogram problem posed by molecular data sets. Journal of Theoretical Biology, 38:423–457, 1973.Google Scholar

[179] B. M. E., Moret, L., Nakhleh, T., Warnow, et al.Phylogenetic networks: modeling, reconstructibility, and accuracy. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 1(1):13–23, 2004.Google Scholar

[180] D., Morrison. Networks in phylogenetic analysis: new tools for population biology. International Journal for Parasitology, 35(5):567–582, 2005.Google Scholar

[181] D., Morrison. Phylogenetic networks in systematic biology (and elsewhere). In R., Mohan, ed., Research Advances in Systematic Biology, pp. 1–48. Global Research Network, Trivandrum, India, 2010.Google Scholar

[182] V., Moulton and K. T., Huber. Split networks. a tool for exploring complex evolutionary relationships in molecular data. In P., Lemey, M., Salemi, and A. -M., Vandamme, eds., The Phylogenetic Handbook, 2nd edn. pp. 631–653. Cambridge University Press, 2009.Google Scholar

[183] L., Nakhleh. A metric on the space of reduced phylogenetic networks. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 99(RapidPosts), 2009.Google Scholar

[184] L., Nakhleh. Evolutionary phylogenetic networks:models and issues. In L. L. S., Heath and N., Ramakrishnan, eds., The Problem Solving Handbook for Computational Biology and Bioinformatics. Springer, 2010.Google Scholar

[185] L., Nakhleh, T., Warnow, and C. R., Linder. Reconstructing reticulate evolution in species: theory and practice. In Proceedings of the Eighth International Conference on Research in Computational Molecular Biology (RECOMB), pp. 337–346. ACM Press, 2004.Google Scholar

[186] S. B., Needleman and C. D., Wunsch. A general method applicable to the search for similarities in the amino acid sequences of two proteins. Journal of Molecular Biology, 48:443–453, 1970.Google Scholar

[187] M., Nei. Estimation of average heterozygosity and genetic distance from a small number of individuals. Genetics, 89:583–590, 1978.Google Scholar

[188] C., Notredame, D. G., Higgins, and J., Heringa. T-Coffee: a novel method for fast and accurate multiple sequence alignment. Journal of Molecular Biology, 302(1):205–217, 2000.Google Scholar

[189] H., Ochman, J. G., Lawrence, and E. A., Groisman. Lateral gene transfer and the nature of bacterial innovation. Nature, 405(6784):299–304, 2000.Google Scholar

[190] K., O'Donnell, H., Kistler, B., Tacke, and H., Casper. Gene genealogies reveal global phylogeographic structure and reproductive isolation among lineages of Fusarium graminearum, the fungus causing wheat scab. PNAS, 97(14):7905–7910, 2000.Google Scholar

[191] R. D. M., Page. On islands of trees and the efficacy of different methods of branch swapping in finding most-parsimonious trees. Systematic Biology, 42(2):200–210, 1993.Google Scholar

[192] R. D. M., Page. Modified mincut supertrees. In R., Guigó and D., Gusfield, eds., Algorithms in Bioinformatics: Proceedings of the 2nd International Workshop on Algorithms in Bioinformatics (WABI), vol. 2452 of LNCS, pp. 537–552, 2002.Google Scholar

[193] E., Paradis. pegas: an R package for population genetics with an integrated-modular approach. Bioinformatics, 26(3):419–420, 2010.Google Scholar

[194] L., Parida, M., Melé, F., Calafell, and J., Bertranpetit. Estimating the ancestral recombinations graph (ARG) as compatible networks of SNP patterns. Journal of Computational Biology, 15(9):1133–1153, 2008.Google Scholar

[195] N., Patterson, D. J., Richter, S., Gnerre, E. S., Lander, and D., Reich. Genetic evidence for complex speciation of humans and chimpanzees. Nature, 441:1103–1108, 2006.Google Scholar

[196] Y., Pauplin. Direct calculation of a tree length using a distance matrix. Journal of Molecular Biology, 51(1):41–47, 2000.Google Scholar

[197] P. J., Planet, S. C., Kachlany, D. H., Fine, R., DeSalle, and D. H., Figurski. The widespread colonization island of Actinobacillus actinomycetemcomitans. Nature Genetics, 34:193–198, 2003.Google Scholar

[198] D., Posda and K. A., Crandall. The effect of recombination on the accuracy of phylogeny estimation. Journal of Molecular Evolution, 54:396–402, 2002.Google Scholar

[199] R. C., Prim. Shortest connection networks and some generalizations. Bell System Technology Journal, 36:1389–1401, 1957.Google Scholar

[200] S. J., Prohaska, C., Fried, C. T., Amemiya, F. H., Ruddle, G. P., Wagner, and P. F., Stadler. The shark HoxN cluster is homologous to the human HoxD cluster. Journal of Molecular Evolution, 58:212–217, 2004.Google Scholar

[201] L. H., Rieseberg. Hybrid origins of plant species. Annual Review of Ecology Evolution and Systematics, 28:359–389, 1997.Google Scholar

[202] L. H., Rieseberg, S. J. E., Baird, and K. A., Gardner. Hybridization, introgression, and linkage evolution. Plant Molecular Biology, 42:205–224, 2000.Google Scholar

[203] D. F., Robinson. Comparison of labeled trees with valency three. Journal of Combinatorial Theory, Series B, 11(2):105–119, 1971.Google Scholar

[204] D. F., Robinson and L. R., Foulds. Comparison of phylogenetic trees. Mathematical Biosciences, 53:131–147, 1981.Google Scholar

[205] F., Rodríguez, J. L., Oliver, A., Marín, and J. R., Medina. The general stochastic model of nucleotide substitution. Journal of Theoretical Biology, 142(4):485–501, 1990.Google Scholar

[206] A., Rokas, B. L., Williams, N., King, and S. B., Carroll. Genome-scale approaches to resolving incongruence in molecular phylogenies. Nature, 425:798–804, 2003.Google Scholar

[207] D., Ruths and L., Nakhleh. Recombination and phylogeny: effects and detection. International Journal of Bioinformatics Research and Applications, 1(2):202–212, 2005.Google Scholar

[208] N., Saitou and M., Nei. The Neighbor-Joining method: a new method for reconstructing phylogenetic trees. Molecular Biology and Evolution, 4:406–425, 1987.Google Scholar

[209] M., Salemi, T., DeOliveira, V., Courgnaud, et al.Mosaic genomes of the six major primate lentivirus lineages revealed by phylogenetic analyses. Journal of Virology, 77(13):7202–7213, 2003.Google Scholar

[210] D., Sankoff. Minimal mutation trees of sequences. SIAM Journal of Applied Mathematics, 28:35–42, 1975.Google Scholar

[211] M. H., Schierup and J., Hein. Consequences of recombination on traditional phylogenetic analysis. Genetics, 156:879–891, 2000.Google Scholar

[212] C., Scornavacca, V., Berry, V., Lefort, E. J. P., Douzery, and V., Ranwez. PhySIC_IST: cleaning source trees to infer more informative supertrees. BMC Bioinformatics, 9(8):413, 2008.Google Scholar

[213] C., Semple. Reconstructing minimal rooted trees. Discrete Applied Mathematics, 127(3):489–503, 2003.Google Scholar

[214] C., Semple. Hybridization networks. In O., Gascuel and M., Steel, eds., Reconstructing Evolution: New Mathematical and Computational Advances, pp. 277–314. Oxford University Press, 2007.Google Scholar

[215] C., Semple and M., Steel. A supertree method for rooted trees. Discrete Applied Mathematics, 105(1–3):147–158, 2000.Google Scholar

[216] C., Semple and M., Steel. Cyclic permutations and evolutionary trees. Advances in Applied Mathematics, 32(4):669–680, 2004.Google Scholar

[217] C., Semple and M. A., Steel. Phylogenetics. Oxford University Press, 2003.Google Scholar

[218] T. F., Smith and M. S., Waterman. Identification of common molecular subsequences. Journal of Molecular Biology, 147:195–197, 1981.Google Scholar

[219] P., Sneath. Cladistic representation of reticulate evolution. Systematic Zoology, 24(3):360–368, 1975.Google Scholar

[220] R. R., Sokal and C. D., Michener. A statistical method for evaluating systematic relationships. University of Kansas Scientific Bulletin, 28:1409–1438, 1958.Google Scholar

[221] Y. S., Song. A concise necessary and sufficient condition for the existence of a galledtree. IEEE/ACM Transactions in Computational Biology and Bioinformatics, 3(2):186–191, 2006.Google Scholar

[222] Y. S., Song and J., Hein. Parsimonious reconstruction of sequence evolution and haplotype blocks: Finding the minimum number of recombination events. In Algorithms in Bioinformatics: Proceedings of the Third International Workshop on Algorithms in Bioinformatics (WABI), vol. 2812, LNBI, pp. 287–302, 2003.Google Scholar

[223] Y. S., Song and J., Hein. On the minimum number of recombination events in the evolutionary history of DNA sequences. Journal of Mathematical Biology, 48:160–186, 2004.Google Scholar

[224] Y. S., Song and J., Hein. Constructing minimal ancestral recombination graphs. Journal of Computational Biology, 12(2):147–69, 2005.Google Scholar

[225] Y. S., Song, Y., Wu, and D., Gusfield. Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution. Bioinformatics, 21:413–422, 2005.Google Scholar

[226] M., Spencer, E. A., Davidson, A. C., Barbrook, and C. J., Howe. Phylogenetics of artificial manuscripts. Journal of Theoretical Biology, 227(4):503–511, 2004.Google Scholar

[227] M. A., Steel and A. M., Hamel. Finding a maximum compatible tree is NP-hard for sequences and trees. Applied Mathematics Letters, 9(2):55–59, 1996.Google Scholar

[228] K., Strimmer and V., Moulton. Likelihood analysis of phylogenetic networks using directed graphical models. Molecular Biology and Evolution, 17(6):875–881, 2000.Google Scholar

[229] J. A., Studier and K. J., Keppler. A note on the neighbor-joining method of Saitou and Nei. Molecular Biology and Evolution, 5(6):729–731, 1988.Google Scholar

[230] D. L., Swofford, G. J., Olsen, P. J., Waddell, and D. M., Hillis. Chapter 11: Phylogenetic inference. In D. M., Hillis, C., Moritz, and B. K., Mable, eds., Molecular Systematics, 2nd edn., pp. 407–514. Sinauer Associates, Inc., 1996.Google Scholar

[231] M., Syvanen. Cross-species gene transfer; implications for a new theory of evolution. Journal of Theoretical Biology, 112(2):333–43, 1985.Google Scholar

[232] K., Tamura and M., Nei. Estimation of the number of nucleotide substitutions in the control region of mitochondrial DNA in humans and chimpanzees. Molecular Biology and Evolution, 10(3):512–526, 1993.Google Scholar

[233] A. R., Templeton, K. A., Crandall, and C. F., Sing. A cladistic analysis of phenotypic associations with haplotypes inferred from restriction endonuclease mapping and DNA sequence data III cladogram estimation. Genetics, 132:619–633, 1992.Google Scholar

[234] C., Than, D., Ruths, and L., Nakhleh. PhyloNet: a software package for analyzing and reconstructing reticulate evolutionary relationships. BMC Bioinformatics, 9:322, 2008.Google Scholar

[235] J. D., Thompson, D. G., Higgins, and T. J., Gibson. CLUSTAL W: improving the sensitivity of progressive multiple sequence alignment through sequence weighting, position-specific gap penalties and weight matrix choice. Nucleic Acids Research, 22:4673–4680, 1994.Google Scholar

[236] T. -H., To and M., Habib. Level-k phylogenetic networks are constructable from a dense triplet set in polynomial time. In Combinatorial Pattern Matching: Proceeding of the 20th Annual Symposium Combinatorial Pattern Matching (CPM), vol. 5577, LNCS, pp. 275–288, 2009.Google Scholar

[237] A., Tofigh, M., Hallet, and J., Lagergren. Simultaneous identification of duplications and lateral gene transfers. IEEE/ACM Transactions on Computational Biology and Bioinformatics, 99(PrePrints), 2010.Google Scholar

[238] A., Tofigh and J., Lagergren. Inferring duplications and lateral gene transfers- an algorithm for parametric tree reconciliation. Unpublished manuscript, 2009.

[239] J., Wagele and C., Mayer. Visualizing differences in phylogenetic information content of alignments and distinction of three classes of long-branch effects. BMC Evolutionary Biology, 7(1):147, 2007.Google Scholar

[240] L., Wang and T., Jiang. On the complexity of multiple sequence alignment. Journal of Computational Biology, 1(4):337–348, 1994.Google Scholar

[241] L., Wang, K., Zhang, and L., Zhang. Perfect phylogenetic networks with recombination. Journal of Computational Biology, 8(1):69–78, 2001.Google Scholar

[242] D., Weigel and R., Mott. The 1001 genomes project for Arabidopsis thaliana. Genome Biology, 10(5):107, 2009.Google Scholar

[243] J., Whitfield, S., Cameron, D., Huson, and M., Steel. Filtered Z-closure supernetworks for extracting and visualizing recurrent signal from incongruent gene trees. Systematic Biology, 57(6):939–947, 2008.Google Scholar

[244] B. Y., Wu. Constructing the maximum consensus tree from rooted triples. Journal of Combinatorial Optimization, 8(1):29–39, 2004.Google Scholar

[245] G.-S., Wu, Y.-G., Yao, K.-X., Qu, et al.Population phylogenomic analysis of mitochondrial DNA in wild boars and domestic pigs revealed multiple domestication events in East Asia. Genome Biology, 8(11):R245, 2007.Google Scholar

[246] Z., Yang. Among-site rate variation and its impact on phylogenetic analyses. Trends in Ecology and Evolution, 11:367–372, 1996.Google Scholar

[247] A., Zharkikh. Estimation of evolutionary distances between nucleotide sequences. Journal of Molecular Evolution, 39(3):315–329, 1994.Google Scholar