Nonredundant Representation of Ancestral Recombinations Graphs
互联网
387
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 
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.
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.
