Related Experiment Video
Updated: May 24, 2026

Molecular Evolution of the Tre Recombinase
Published on: May 29, 2008
Nonredundant representation of ancestral recombinations graphs
1IBM Thomas J. Watson Research Center, Yorktown Heights, NY, USA. parida@us.ibm.com
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.
More Related Videos
08:03Heuristic Mining of Hierarchical Genotypes and Accessory Genome Loci in Bacterial Populations
Published on: December 7, 2021
10:44Inherent Dynamics Visualizer, an Interactive Application for Evaluating and Visualizing Outputs from a Gene Regulatory Network Inference Pipeline
Published on: December 7, 2021
Related Concept Videos
Homologous Recombination
Homologous Recombination
Exon Recombination
Exon shuffling follows “splice frame rules.” Each exon has three reading...
Evolutionary Relationships through Genome Comparisons
Conservative Site-specific Recombination and Phase Variation
The recognition sites for Cre recombinase called LoxP...
Gene Duplication and Divergence
The duplicated copies of the gene are called Paralogs. Paralogs with similar sequences and functions form a gene family. Across several species, a large number of gene families are characterized.