Efficient and Practical Algorithms for Deducing the History of Recombination in Populations

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


A phylogenetic network (or Ancestral Recombination Graph) is a generalization of a tree, allowing structural properties that are not tree-like. With the growth of genomic and population data, much of which does not fit ideal tree models, and the increasing appreciation of the genomic role of such phenomena as recombination (crossing-over and gene-conversion), recurrent and back mutation, horizontal gene transfer, and mobile genetic elements, there is greater need to understand the algorithmics and combinatorics of phylogenetic networks.


Horizontal Gene Transfer Computational Biology Mobile Genetic Element Phylogenetic Network Practical Algorithm 
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.


  1. 1.
    Gusfield, D., Eddhu, S., Langley, C.: Optimal, efficient reconstruction of phylogenetic networks with constrained recombination. Journal of Bioinformatics and Computational Biology 2(1), 173–213 (2004)CrossRefGoogle Scholar
  2. 2.
    Gusfield, D., Eddhu, S., Langley, C.: The fine structure of galls in phylogenetic networks. INFORMS J. on Computing, Special issue on Computational Biology 16(4), 459–469 (2004)MathSciNetGoogle Scholar
  3. 3.
    Gusfield, D.: Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained recombination. J. Computer and Systems Sciences, Special issue on Computational Biology 70, 381–398 (2005)MathSciNetMATHGoogle Scholar
  4. 4.
    Gusfield, D., Bansal, V.: A fundamental decomposition theory for phylogenetic networks and incompatible characters. In: Miyano, S., Mesirov, J., Kasif, S., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2005. LNCS (LNBI), vol. 3500, pp. 217–232. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Gusfield, D., Hickerson, D., Eddhu, S.: A fundamental, efficiently computed lower bound on the number of recombinations needed in a phylogenetic history. Discrete Applied Math, Special issue on Computational Biology (to appear)Google Scholar
  6. 6.
    Song, Y., Wu, Y., Gusfield, D.: Efficient computation of close lower and upper bounds on the minimum number of needed recombinations in the evolution of biological sequences. Bioinformatics 21(Supplement 1, Proceedings of the ISMB 2005 Conference), 413–422 (2005)CrossRefGoogle Scholar
  7. 7.
    Song, Y., Gusfield, D., Ding, Z., Langley, C., Wu, Y.: Algorithms to distinguish the role of gene-conversion from single-crossover recombination in the derivation of snp sequences in populations. In: Apostolico, A., Guerra, C., Istrail, S., Pevzner, P.A., Waterman, M. (eds.) RECOMB 2006. LNCS (LNBI), vol. 3909, pp. 231–245. Springer, Heidelberg (2006)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Dan Gusfield
    • 1
  1. 1.University of CaliforniaDavis

Personalised recommendations