A Fundamental Decomposition Theory for Phylogenetic Networks and Incompatible Characters

  • Dan Gusfield
  • Vikas Bansal
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3500)

Abstract

Phylogenetic networks are models of evolution that go beyond trees, allowing biological operations that are not consistent with tree-like evolution. One of the most important of these biological operations is recombination between two sequences (homologous chromosomes). The algorithmic problem of reconstructing a history of recombinations, or determining the minimum number of recombinations needed, has been studied in a number of papers [10, 11, 12, 23, 24, 25, 16, 13, 14, 6, 9, 8, 18, 19, 15, 1]. In [9, 6, 10, 8, 1] we introduced and used “conflict graphs” and “incompatibility graphs” to compute lower bounds on the minimum number of recombinations needed, and to efficiently solve constrained cases of the minimization problem. In those results, the non-trivial connected components of the graphs were the key features that were used.

In this paper we more fully develop the structural importance of non-trivial connected components of the incompatibility graph, to establish a fundamental decomposition theorem about phylogenetic networks. The result applies to phylogenetic networks where cycles reflect biological phenomena other than recombination, such as recurrent mutation and lateral gene transfer. The proof leads to an efficient O(nm2) time algorithm to find the underlying maximal tree structure defined by the decomposition, for any set of n sequences of length m each. An implementation of that algorithm is available. We also report on progress towards resolving the major open problem in this area.

Keywords

Molecular Evolution Phylogenetic Networks Perfect Phylogeny Ancestral Recombination Graph Recombination Gene-Conversion SNP 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bafna, V., Bansal, V.: The number of recombination events in a sample history: conflict graph and lower bounds. IEEE/ACM Transactions on Computational Biology and Bioinformatics 1, 78–90 (2004)CrossRefGoogle Scholar
  2. 2.
    Chakravarti, A.: It’s raining SNP’s, hallelujah? Nature Genetics 19, 216–217 (1998)CrossRefGoogle Scholar
  3. 3.
    Felsenstein, J.: Inferring Phylogenies. Sinauer, Sunderland (2004)Google Scholar
  4. 4.
    Gusfield, D.: Efficient algorithms for inferring evolutionary history. Networks 21, 19–28 (1991)MATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Gusfield, D.: Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Cambridge University Press, Cambridge (1997)MATHCrossRefGoogle Scholar
  6. 6.
    Gusfield, D.: Optimal, efficient reconstruction of Root-Unknown phylogenetic networks with constrained recombination. Technical report, Department of Computer Science, University of California, Davis, CA (2004)Google Scholar
  7. 7.
    Gusfield, D.: On the decomposition optimality conjecture for phylogenetic networks. Technical report, UC Davis, Department of Computer Science (2005)Google Scholar
  8. 8.
    Gusfield, D., Eddhu, S., Langley, C.: The fine structure of galls in phylogenetic networks. INFORMS J. on Computing, special issue on Computational Biology 16, 459–469 (2004)MathSciNetGoogle Scholar
  9. 9.
    Gusfield, D., Eddhu, S., Langley, C.: Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. J. Bioinformatics and Computational Biology 2(1), 173–213 (2004)CrossRefGoogle Scholar
  10. 10.
    Gusfield, D., Hickerson, D.: A new lower bound on the number of needed recombination nodes in both unrooted and rooted phylogenetic networks. Report UCD-ECS-06. Technical report, University of California, Davis (2004)Google Scholar
  11. 11.
    Hein, J.: Reconstructing evolution of sequences subject to recombination using parsimony. Math. Biosci. 98, 185–200 (1990)MATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Hein, J.: A heuristic method to reconstruct the history of sequences subject to recombination. J. Mol. Evol. 36, 396–405 (1993)CrossRefGoogle Scholar
  13. 13.
    Hudson, R., Kaplan, N.: Statistical properties of the number of recombination events in the history of a sample of DNA sequences. Genetics 111, 147–164 (1985)Google Scholar
  14. 14.
    Kececioglu, J.D., Gusfield, D.: Reconstructing a history of recombinations from a set of sequences. Discrete Applied Math. 88, 239–260 (1998)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Moret, B., Nakhleh, L., Warnow, T., Linder, C.R., Tholse, A., Padolina, A., Sun, J., Timme, R.: Phylogenetic networks: Modeling, reconstructibility, and accuracy. IEEE/ACM Transactions on Computatational Biology and Bioinformatics, 13–23 (2004)Google Scholar
  16. 16.
    Myers, S.R., Griffiths, R.C.: Bounds on the minimum number of recombination events in a sample history. Genetics 163, 375–394 (2003)Google Scholar
  17. 17.
    Myers, S.: The detection of recombination events using DNA sequence data. PhD thesis, University of Oxford, Oxford England, Department of Statistics (2003)Google Scholar
  18. 18.
    Nakhleh, L., Sun, J., Warnow, T., Linder, C.R., Moret, B.M.E., Tholse, A.: Towards the development of computational tools for evaluating phylogenetic network reconstruction methods. In: Proc. of 8th Pacific Symposium on Biocomputing (PSB 2003), pp. 315–326 (2003)Google Scholar
  19. 19.
    Nakhleh, L., Warnow, T., Linder, C.R.: Reconstructing reticulate evolution in species - theory and practice. In: Proc. of 8th Annual International Conference on Computational Molecular Biology, pp. 337–346 (2004)Google Scholar
  20. 20.
    Posada, D., Crandall, K.: Intraspecific gene genealogies: trees grafting into networks. Trends in Ecology and Evolution 16, 37–45 (2001)CrossRefGoogle Scholar
  21. 21.
    Semple, C., Steel, M.: Phylogenetics. Oxford University Press, Oxford (2003)MATHGoogle Scholar
  22. 22.
    Song, Y.: Personal CommunicationGoogle Scholar
  23. 23.
    Song, Y., Hein, J.: Parsimonious reconstruction of sequence evolution and haplotype blocks: Finding the minmimum number of recombination events. In: Benson, G., Page, R.D.M. (eds.) WABI 2003. LNCS (LNBI), vol. 2812, pp. 287–302. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  24. 24.
    Song, Y., Hein, J.: On the minimum number of recombination events in the evolutionary history of DNA sequences. Journal of Mathematical Biology 48, 160–186 (2004)MATHCrossRefMathSciNetGoogle Scholar
  25. 25.
    Wang, L., Zhang, K., Zhang, L.: Perfect phylogenetic networks with recombination. Journal of Computational Biology 8, 69–78 (2001)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Dan Gusfield
    • 1
  • Vikas Bansal
    • 2
  1. 1.Department of Computer ScienceUniversity of CaliforniaDavis
  2. 2.Department of Computer Science and EngineeringUniversity of CaliforniaSan Diego

Personalised recommendations