title: Nonredundant representation of ancestral recombinations graphs.
abstract: The network structure that captures the common evolutionary history of a diploid population has been termed an ancestral recombinations graph. When the structure is a tree the number of internal nodes is usually [Formula: see text] where K is the number of samples. However, when the structure is not a tree, this number has been observed to be very large. We explore the possible redundancies in this structure. This has implications both in simulations and in reconstructability studies.
authors.affiliation: IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA. parida@us.ibm.com
authors.forename: Laxmi
authors.initials: L
authors.lastname: Parida
mesh_terms: D003196:Computer Graphics; D019143:Evolution, Molecular; D006801:Humans; D008957:Models, Genetic; D010802:Phylogeny; D011995:Recombination, Genetic