Translating DNA data tables into quasi-median networks for parsimony analysis and error detection.
Every DNA data table can be turned into a quasi-median network that faithfully represents the data. We show that for (weighted) condensed data tables the associated network harbors all most parsimonious reconstructions for any tree that connects the sampled haplotypes. Structural features of this network can be computed directly from the data table. The key principle repeatedly used is that the quasi-median network is uniquely determined by the sub-tables for pairs of characters. The translation of a table into a network enhances the understanding of the properties of the data in regard to homoplasy and potential artifacts. The total number of nodes of such a network measures the complexity of the data. In particular, networks that display the results of filter analyses by which hotspot mutations are removed help to detect data idiosyncrasies and thus pinpoint sequencing problems. A pertinent example drawn from human mtDNA illustrates these points.
Bandelt
Hans-Jürgen
HJ
Department of Mathematics, University of Hamburg, 20146 Hamburg, Germany. bandelt@math.uni-hamburg.de
Dür
Arne
A
D000818:Animals; D004247:DNA / Q000235:genetics*; D004272:DNA, Mitochondrial / Q000235:genetics; D014644:Genetic Variation; D006239:Haplotypes; D006801:Humans; D008957:Models, Genetic; D010802:Phylogeny; D020641:Polymorphism, Single Nucleotide; D017422:Sequence Analysis, DNA / Q000379:methods*
D004272:DNA, Mitochondrial; D004247:DNA