Reconstructing phylogenetic networks with one recombination

Authors:
Ernst Althaus;Rouven Naujoks
Affiliations:
Max-Planck-Institut für Informatik, Saarbrücken, Germany;Max-Planck-Institut für Informatik, Saarbrücken, Germany
Venue:
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Year:
2008

Citing 9
Cited 0

Reconstructing a history of recombinations from a set of sequences

Discrete Applied Mathematics - Special volume on computational molecular biology DAM-CMB series volume 2
Efficient Reconstruction of Phylogenetic Networks with Constrained Recombination

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Reconstructing Phylogenetic Networks Using Maximum Parsimony

CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
Computing steiner minimum trees in Hamming metric

SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Computing recombination networks from binary sequences

Bioinformatics
NetGen: generating phylogenetic networks with diploid hybrids

Bioinformatics
Recco: recombination analysis using cost optimization

Bioinformatics
Efficient parsimony-based methods for phylogenetic network reconstruction

Bioinformatics
Recombination and phylogeny: effects and detection

International Journal of Bioinformatics Research and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we propose a new method for reconstructing phylogenetic networks under the assumption that recombination events have occurred rarely. For a fixed number of recombinations, we give a generalization of the maximum parsimony criterion. Furthermore, we describe an exact algorithm for one recombination event and show that in this case our method is not only able to identify the recombined sequence but also to reliably reconstruct the complete evolutionary history.