Article

Removing noise from gene trees

Authors:

Andrea Doroftei,

Nadia El-MabroukAuthors Info & Claims

WABI'11: Proceedings of the 11th international conference on Algorithms in bioinformatics

Pages 76 - 91

Published: 05 September 2011 Publication History

Abstract

Reconciliation is the commonly used method for inferring the evolutionary scenario for a gene family. It consists in "embedding" an inferred gene tree into a known species tree, revealing the evolution of the gene family by duplications and losses. The main complaint about reconciliation is that the inferred evolutionary scenario is strongly dependant on the considered gene tree, as few misplaced leaves may lead to a completely different history, with significantly more duplications and losses. As using different phylogenetic methods with different parameters may lead to different gene trees, it is essential to have criteria to choose, among those, the appropriate one for reconciliation. In this paper, following the conclusion of a previous paper, we flag certain duplication vertices of a gene tree, the "non-apparent duplication" (NAD) vertices, as resulting from the misplacement of leaves, and consider the optimization problem of removing the minimum number of leaves leading to a tree without any NAD vertex. We develop a polynomial-time algorithm that is exact for two special classes of gene trees, and show a good performance on simulated data sets in the general case.

References

[1]

Amir, A., Keselman, D.: Maximum agreement subtree in a set of evolutionary trees: matrics and efficient algorithms. SIAM J. Computing 26, 1656-1669 (1997).

Digital Library

[2]

Blomme, T., Vandepoele, K., De Bodt, S., Silmillion, C., Maere, S., van de Peer, Y.: The gain and loss of genes during 600 millions years of vertebrate evolution. Genome Biology 7, R43 (2006).

[3]

Bonizzoni, P., Della Vedova, G., Dondi, R.: Reconciling a gene tree to a species tree under the duplication cost model. Theoretical Computer Science 347, 36-53 (2005).

Digital Library

[4]

Chauve, C., Doyon, J.-P., El-Mabrouk, N.: Gene family evolution by duplication, speciation and loss. J. Comput. Biol. 15, 1043-1062 (2008).

[5]

Chauve, C., El-Mabrouk, N.: New perspectives on gene family evolution: Losses in reconciliation and a link with supertrees. In: Batzoglou, S. (ed.) RECOMB 2009. LNCS, vol. 5541, pp. 46-58. Springer, Heidelberg (2009).

Digital Library

[6]

Chen, K., Durand, D., Farach-Colton, M.: Notung: Dating gene duplications using gene family trees. Journal of Computational Biology 7, 429-447 (2000).

[7]

Cole, R., Farach-Colton, M., Hariharan, R., Przytycka, T., Thorup, M.: An o(n log n) algorithm for the maximum agreement subtree problem for binary trees. SIAM J. Computing 30(5), 1385-1404 (2000).

Digital Library

[8]

Cotton, J.A., Page, R.D.M.: Rates and patterns of gene duplication and loss in the human genome. Proceedings of the Royal Society of London Series B 272, 277-283 (2005).

[9]

Doyon, J.-P., Scornavacca, C., Gorbunov, K., Szolloso, G., Ranwez, V., Berry, V.: An effi. algo. for gene/species trees parsim. reconc. with losses, dup. and transf. J. Comp. Biol. 6398, 93-108 (2010).

Digital Library

[10]

Durand, D., Haldórsson, B.V., Vernot, B.: A hybrid micro-macroevolutionary approach to gene tree reconstruction. Journal of Computational Biology 13, 320-335 (2006).

[11]

Eichler, E.E., Sankoff, D.: Structural dynamics of eukaryotic chromosome evolution. Science 301, 793-797 (2003).

[12]

Finden, C.R., Gordon, A.D.: Obtaining common pruned trees. J. Classification 2, 255-276 (1985).

[13]

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).

[14]

Gorecki, P., Tiuryn, J.: DLS-trees: a model of evolutionary scenarios. Theoretical Computer Science 359, 378-399 (2006).

Digital Library

[15]

Guigó, R., Muchnik, I., Smith, T.F.: Reconstruction of ancient molecular phylogeny. Molecular Phylogenetics and Evolution 6, 189-213 (1996).

[16]

Hahn, M.W.: Bias in phylogenetic tree reconciliation methods: implications for vertebrate genome evolution. Genome Biology 8(R141) (2007).

[17]

Hahn, M.W., Han, M.V., Han, S.-G.: Gene family evolution across 12 drosophilia genomes. PLoS Genetics 3, e197 (2007).

[18]

Hallett, M., Lagergren, J., Tofigh, A.: Simultaneous identification of duplications and lateral transfers. In: RECOMB. ACM, New York (2004).

Digital Library

[19]

Li, W.H., Gu, Z., Wang, H., Nekrutenko, A.: Evolutionary analysis of the human genome. Nature 409, 847-849 (2001).

[20]

Ma, B., Li, M., Zhang, L.: From gene trees to species trees. SIAM J. on Comput. 30, 729-752 (2000).

Digital Library

[21]

Ohno, S.: Evolution by gene duplication. Springer, Berlin (1970).

[22]

Page, R.D.M.: Maps between trees and cladistic analysis of historical associations among genes, organisms, and areas. Systematic Biology 43, 58-77 (1994).

[23]

Page, R.D.M.: Genetree: comparing gene and species phylogenies using reconciled trees. Bioinformatics 14, 819-820 (1998).

[24]

Page, R.D.M., Charleston, M.A.: Reconciled trees and incongruent gene and species trees. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 37, 57-70 (1997).

[25]

Sanderson, M.J., McMahon, M.M.: Inferring angiosperm phylogeny from EST data with widespread gene duplication. BMC Evolutionary Biology 7, S3 (2007).

[26]

Steel, M., Warnow, T.: Kaikoura tree theorems: computing the maximum agreement subtree. Inform. Process. Lett. 48, 77-82 (1993).

Digital Library

[27]

Tofigh, A., Hallett, M., Lagergren, J.: Simultaneous identification of duplications and lateral gene transfers. IEEE/ACM Trans. Comput. Biol. Bioinform. 8, 517-535 (2011).

Digital Library

[28]

Wapinski, I., Pfeffer, A., Friedman, N., Regev, A.: Natural history and evolutionary principles of gene duplication in fungi. Nature 449, 54-61 (2007).

[29]

Zhang, L.X.: On Mirkin-Muchnik-Smith conjecture for comparing molecular phylogenies. Journal of Computational Biology 4, 177-188 (1997).

Cited By

Lafond MSwenson KEl-Mabrouk N(2012)An optimal reconciliation algorithm for gene trees with polytomiesProceedings of the 12th international conference on Algorithms in Bioinformatics10.1007/978-3-642-33122-0_9(106-122)Online publication date: 10-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33122-0_9

Recommendations

Rooting Gene Trees via Phylogenetic Networks
Computing and Combinatorics
Abstract
Gene trees inferred from alignments of molecular sequences are usually unrooted. Since the root of a gene tree is often the desired property, one of the most classical problems in computational biology is gene tree rooting, where the goal is to ...
From Gene Trees to Species Trees II: Species Tree Inference by Minimizing Deep Coalescence Events

When gene copies are sampled from various species, the resulting gene tree might disagree with the containing species tree. The primary causes of gene tree and species tree discord include incomplete lineage sorting, horizontal gene transfer, and gene ...
Phylogenetic network-assisted rooting of unrooted gene trees
Abstract
Gene trees inferred from molecular sequence alignments are typically unrooted, and determining the most credible rooting edge is a classical problem in computational biology. One approach to solve this problem is unrooted reconciliation, where the ...

Comments

Information & Contributors

Information

Published In

cover image Guide Proceedings

WABI'11: Proceedings of the 11th international conference on Algorithms in bioinformatics

September 2011

377 pages

ISBN:9783642230370

Editors:
Teresa M. Przytycka
National Center for Biotechnology Information, U.S. National Library of Medicine, Bethesda, MD
,
Marie-France Sagot
Institut National de Recherche en Informatique et en Automatique and Université Lyon 1

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 05 September 2011

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

1
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

Lafond MSwenson KEl-Mabrouk N(2012)An optimal reconciliation algorithm for gene trees with polytomiesProceedings of the 12th international conference on Algorithms in Bioinformatics10.1007/978-3-642-33122-0_9(106-122)Online publication date: 10-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33122-0_9

View Options

View options

Media

Figures

Other

Tables

View Table of Contents