Computing recombination networks from binary sequences.
BACKGROUND
Phylogenetic networks are becoming an important tool in molecular evolution, as the evolutionary role of reticulate events, such as hybridization, horizontal gene transfer and recombination, is becoming more evident, and as the available data is dramatically increasing in quantity and quality.


RESULTS
This paper addresses the problem of computing a most parsimonious recombination network for an alignment of binary sequences that are assumed to have arisen under the 'infinite sites' model of evolution with recombinations. Using the concept of a splits network as the underlying datastructure, this paper shows how a recent method designed for the computation of hybridization networks can be extended to also compute recombination networks. A robust implementation of the approach is provided and is illustrated using a number of real biological datasets.


BACKGROUND
Our implementation of this approach is freely available as part of the SplitsTree4 software, downloadable from www.splitstree.org
Huson
Daniel H
DH
Center for Bioinformatics, Tübingen University Sand 14, Tübingen, Germany. huson@informatik.uni-tuebingen.de
Kloepper
Tobias H
TH
D000465:Algorithms; D002874:Chromosome Mapping / Q000379:methods*; D004252:DNA Mutational Analysis / Q000379:methods*; D019143:Evolution, Molecular; D014644:Genetic Variation / Q000235:genetics*; D008957:Models, Genetic; D010802:Phylogeny; D011995:Recombination, Genetic / Q000235:genetics*; D017422:Sequence Analysis, DNA / Q000379:methods*; D012815:Signal Processing, Computer-Assisted; D015398:Signal Transduction / Q000235:genetics*; D012984:Software; D016008:Statistical Distributions