Abstract
The gene duplication problem seeks a species tree that reconciles given gene trees with the minimum number of gene duplication events, called gene duplication cost. To better assess species trees inferred by the gene duplication problem we study diameters of the gene duplication cost, which describe fundamental mathematical properties of this cost. The gene duplication cost is defined for a gene tree, a species tree, and a leaf labeling function that maps the leaf-genes of the gene tree to the leaf-species. The diameters of this cost are its maximal values when one topology or both topologies of the trees involved are fixed under all possible leaf labelings, and are fundamental in understanding how gene trees and species trees relate. We describe the properties and formulas for these diameters for bijective and general leaf labelings, and present efficient algorithms to compute the diameters and their corresponding leaf labelings. Moreover, we provide experimental evaluations demonstrating applications of diameters for the gene duplication problem.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Bansal, M.S., Eulenstein, O.: Algorithms for genome-scale phylogenetics using gene tree parsimony. IEEE/ACM Trans. Comput. Biol. Bioinform. 10(4), 939–956 (2013)
Bansal, M.S., Eulenstein, O., Wehe, A.: The gene-duplication problem: near-linear time algorithms for nni-based local searches. IEEE/ACM Trans. Comput. Biol. Bioinform. 6(2), 221–231 (2009)
Chang, W.-C., Górecki, P., Eulenstein, O.: Exact solutions for species tree inference from discordant gene trees. J. Bioinform. Comput. Biol. 11(05), 1342005 (2013)
Cotton, J.A., Page, R.D.M.: Going nuclear: gene family evolution and vertebrate phylogeny reconciled. Proc. Biol. Sci. 269(1500), 1555–1561 (2002)
Eulenstein, O., Huzurbazar, S., Liberles, D.A.: Reconciling Phylogenetic Trees. In: Evolution after Gene Duplication. John Wiley, Hoboken (2010)
Felsenstein, J.: The number of evolutionary trees. Syst. Zool. 27, 27–33 (1978)
Goodman, M., Czelusniak, J., Moore, G.W., Romero-Herrera, A.E., Matsuda, G.: Fitting the gene lineage into its species lineage. A parsimony strategy illustrated by cladograms constructed from globin sequences. Systematic Zoology 28, 132–163 (1979)
Górecki, P., Eulenstein, O.: Algorithms: simultaneous error-correction and rooting for gene tree reconciliation and the gene duplication problem. BMC Bioinformatics 13(suppl. 10), S14 (2012)
Górecki, P., Burleigh, J.G., Eulenstein, O.: GTP supertrees from unrooted gene trees: Linear time algorithms for NNI based local searches. In: Bleris, L., Măndoiu, I., Schwartz, R., Wang, J. (eds.) ISBRA 2012. LNCS, vol. 7292, pp. 102–114. Springer, Heidelberg (2012)
Górecki, P., Eulenstein, O.: Maximizing deep coalescence cost. In: Accepted to IEEE/ACM Trans. Comput. Biol. Bioinform. (2014), preprint is available at http://dx.doi.org/10.1109/TCBB.2013.144
Górecki, P., Eulenstein, O., Tiuryn, J.: Unrooted tree reconciliation: A unified approach. IEEE/ACM Trans. Comput. Biol. Bioinform. 10(2), 522–536 (2013)
Górecki, P., Tiuryn, J.: DLS-trees: A model of evolutionary scenarios. Theor. Comput. Sci. 359(1-3), 378–399 (2006)
Guigó, R., Muchnik, I.B., Smith, T.F.: Reconstruction of ancient molecular phylogeny. Mol. Phylogenet. Evol. 6(2), 189–213 (1996)
Harris, S.R., Cartwright, E.J.P., Török, M.E., Holden, M.T.G., Brown, N.M., Ogilvy-Stuart, A.L., Ellington, M.J., Quail, M.A., Bentley, S.D., Parkhill, J., Peacock, S.J.: Whole-genome sequencing for analysis of an outbreak of meticillin-resistant staphylococcus aureus: a descriptive study. Lancet Infect. Dis. 13(2), 130–136 (2013)
Hedges, S.B., Dudley, J., Kumar, S.: Timetree: a public knowledge-base of divergence times among organisms. Bioinformatics 22(23), 2971–2972 (2006)
Hufbauer, R.A., et al.: Population structure, ploidy levels and allelopathy of Centaurea maculosa (spotted knapweed) and C. diffusa (diffuse knapweed) in North America and Eurasia. In: Proceedings of the International Symposium on Biological Control of Weeds, pp. 121–126 (2003)
Jackson, A.P.: A reconciliation analysis of host switching in plant-fungal symbioses. Evolution 58(9), 1909–1923 (2004)
Lafond, M., Swenson, K.M., El-Mabrouk, N.: An optimal reconciliation algorithm for gene trees with polytomies. In: Raphael, B., Tang, J. (eds.) WABI 2012. LNCS (LNBI), vol. 7534, pp. 106–122. Springer, Heidelberg (2012)
Ma, B., Li, M., Zhang, L.: From gene trees to species trees. SIAM Journal on Computing 30(3), 729–752 (2000)
Martin, A.P., Burg, T.M.: Perils of paralogy: using hsp70 genes for inferring organismal phylogenies. Syst. Biol. 51(4), 570–587 (2002)
McGowen, M.R., Clark, C., Gatesy, J.: The vestigial olfactory receptor subgenome of odontocete whales: phylogenetic congruence between gene-tree reconciliation and supermatrix methods. Syst. Biol. 57(4), 574–590 (2008)
Nik-Zainal, S., et al.: The life history of 21 breast cancers. Cell 149(5), 994–1007 (2012)
Page, R.D.M.: Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas. Systematic Biology 43(1), 58–77 (1994)
Page, R.D.M.: Extracting species trees from complex gene trees: reconciled trees and vertebrate phylogeny. Mol. Phylogenet. Evol. 14, 89–106 (2000)
Page, R.D.M., Holmes, E.C.: Molecular evolution: a phylogenetic approach. Blackwell Science (1998)
Rokas, A., Williams, B.L., King, N., Carroll, S.B.: Genome-scale approaches to resolving incongruence in molecular phylogenies. Nature 425, 798–804 (2003)
Ruan, J., et al.: TreeFam: 2008 Update. Nucleic Acids Res. 36, D735–D740 (2008)
Than, C.V., Rosenberg, N.A.: Mathematical properties of the deep coalescence cost. IEEE/ACM Trans. Comput. Biol. Bioinform. 10(1), 61–72 (2013)
Wehe, A., Bansal, M.S., Burleigh, G.J., Eulenstein, O.: DupTree: a program for large-scale phylogenetic analyses using gene tree parsimony. Bioinformatics 24(13), 1540–1541 (2008)
Wehe, A., Burleigh, J.G., Eulenstein, O.: Efficient algorithms for knowledge-enhanced supertree and supermatrix phylogenetic problems. IEEE/ACM Trans. Comput. Biol. Bioinform. 10(6), 1432–1441 (2013)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Górecki, P., Paszek, J., Eulenstein, O. (2014). Duplication Cost Diameters. In: Basu, M., Pan, Y., Wang, J. (eds) Bioinformatics Research and Applications. ISBRA 2014. Lecture Notes in Computer Science(), vol 8492. Springer, Cham. https://doi.org/10.1007/978-3-319-08171-7_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-08171-7_19
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08170-0
Online ISBN: 978-3-319-08171-7
eBook Packages: Computer ScienceComputer Science (R0)