Efficient and practical algorithms for deducing the history of recombination in populations

Authors:
Dan Gusfield
Affiliations:
University of California, Davis
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
Year:
2006

Citing 6
Cited 0

Optimal, efficient reconstruction of root-unknown phylogenetic networks with constrained and structured recombination

Journal of Computer and System Sciences - Special issue on bioinformatics II
Efficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution

Bioinformatics
An efficiently computed lower bound on the number of recombinations in phylogenetic networks: Theory and empirical study

Discrete Applied Mathematics
The Fine Structure of Galls in Phylogenetic Networks

INFORMS Journal on Computing
A fundamental decomposition theory for phylogenetic networks and incompatible characters

RECOMB'05 Proceedings of the 9th Annual international conference on Research in Computational Molecular Biology
Algorithms to distinguish the role of gene-conversion from single-crossover recombination in the derivation of SNP sequences in populations

RECOMB'06 Proceedings of the 10th annual international conference on Research in Computational Molecular Biology

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.