ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations
The work discussed in this talk falls into the emerging area of Population Genomics. I will first introduce the area and then talk about specific problems and combinatorial algorithms involved in the inference of recombination from population data.
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 (coming for example from the HAPMAP project) 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.
In this talk I will survey a range of our recent algorithmic, mathematical and practical results on phylogenetic networks with recombination and show applications of these results to several issues in Population Genomics.
Various parts of this work are joint work with Satish Eddhu, Chuck Langley, Dean Hickerson, Yun S. Song, Yufeng Wu, V. Bansal, V. Bafna and Z. Ding. All the papers and associated software can be accessed at http://wwwcsif.cs.ucdavis.edu/~gusfield/
KeywordsHorizontal Gene Transfer Computational Biology Mobile Genetic Element HAPMAP Project Phylogenetic Network
- 2.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)Google Scholar
- 3.Gusfield, D., Bansal, V., Bafna, V., Song, Y.S.: a decomposition theory for phylogenetic networks and incompatible characters. J. Computational Biology (December 2007)Google Scholar
- 6.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 (2007)Google Scholar
- 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
- 8.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. In: Bioinformatics, Proceedings of the ISMB 2005 Conference, vol. 21, pp. 413–422 (2005)Google Scholar
- 10.Wu, Y., Gusfield, D.: A new recombination lower bound and the minimum perfect phylogenetic forest problem. In: Proceedings of the 13th Annual International Conference on Combinatorics and Computing, pp. 16–26 (2007)Google Scholar
- 12.Wu, Y., Gusfield, D.: Efficient computation of minimum recombination with genotypes (not haplotypes). In: Proceedings of The Computational Systems Biology Conference (2006)Google Scholar