Abstract
Macro-evolutionary processes (e.g., gene duplication and loss) have rarely been incorporated into gene phylogeny reconstruction methods. Durand et al. [5] have proposed a polynomial time dynamic programming algorithm to find the gene family tree that optimizes a macro-evolutionary criterion which is the weighted sum of the number of gene duplications and losses. The complexity of this algorithm is O(nm 2) where n is the number of species and m is the maximum number of copies of the gene in a species. In this paper, we propose an improved algorithm with time complexity of O(nm) for solving this problem. We also show, that the problem can be solved in O(n) if unit costs are considered for both loss and duplication.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arvestad, L., Berglund, A.C., Lagergren, J., Sennblad, B.: Gene tree reconstruction and orthology analysis based on an integrated model for duplication and sequence evolution. In: Proc. RECOMB 2004, pp. 326–335. ACM Press, New York (2004)
Arvestad, L., Berglund, A.C., Lagergren, J., Sennblad, B.: Bayesian gene/species tree reconciliation and orthology analysis using MCMC. Bioinformatics 19(Suppl. 1), 7–15 (2003)
Chor, B., Tuller, T.: Maximum likelihood of evolutionary trees is hard. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3500, pp. 296–310. Springer, Heidelberg (2005)
Day, W.H.: Computational complexity of inferring phylogenies from dissimilarity matrices. Bull. Math. Biol. 49(4), 461–467 (1987)
Durand, D., Halldórsson, B.V., Vernot, B.: A Hybrid Micro-Macroevolutionary Approach to Gene Tree Reconstruction. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3500, pp. 250–264. Springer, Heidelberg (2005)
Eulenstein, O., Mikrin, B., Vingron, M.: Duplication-based measures of difference between gene and species trees. Journal of Computational Biology 5, 135–148 (1998)
Felsenstein, J.: Phylogenies from molecular sequences: Inference and reliability. Annu. Rev. Genet. 22, 521–565 (1988)
Fitch, W., Margoliash, E.: Construction of phylogenetic trees. Science 155, 279–284 (1967)
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. Syst. Zool. 28, 138–163 (1979)
Guigo, R., Muchnik, I., Smith, T.F.: Reconstruction of ancient phylogenies. Molecular Phylogenetics and Evolution 6, 189–213 (1996)
Hallett, M.T., Lagergren, J.: New algorithms for the duplication-loss model. In: Proc. RECOMB 2000 (2000)
Ma, B., Li, M., Zhang, L.: From gene trees to species trees. SIAM J. on comput. (2000)
Mirkin, B., Muchnik, I., Smith, T.F.: A biologically consistent model for comparing molecular phylogenies. Journal of Computational Biology 2, 493–507 (1995)
Page, R.D.M.: Maps between trees and cladistic analysis of historical associations among genes, organisms and areas. Syst. Zool. 43, 58–77 (1994)
Nei, M.: Molecular Evolution Genetics. Columbia University Press, New York (1987)
Zmasek, C.M., Eddy, S.R.: A simple algorithm to infer gene duplication and speciation events on a gene tree. Bioinformatics 17(9), 821–828 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Behzadi, B., Vingron, M. (2006). An Improved Algorithm for the Macro-evolutionary Phylogeny Problem. In: Lewenstein, M., Valiente, G. (eds) Combinatorial Pattern Matching. CPM 2006. Lecture Notes in Computer Science, vol 4009. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780441_17
Download citation
DOI: https://doi.org/10.1007/11780441_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35455-0
Online ISBN: 978-3-540-35461-1
eBook Packages: Computer ScienceComputer Science (R0)