Related Experiment Video
Updated: Jul 13, 2026

Preparation of the Mgm101 Recombination Protein by MBP-based Tagging Strategy
Published on: June 25, 2013
Reconstructing recombination network from sequence data: the small parsimony problem
Abstract:
The small parsimony problem is studied for reconstructing recombination networks from sequence data. The small parsimony problem is polynomial-time solvable for phylogenetic trees. However, the problem is proved NP-hard even for galled recombination networks. A dynamic programming algorithm is also developed to solve the small parsimony problem. It takes O(dn2(3h)) time on an input recombination network over length-d sequences in which there are h recombination and n - h tree nodes.
Related Concept Videos
Conservative Site-specific Recombination and Phase Variation
The recognition sites for Cre recombinase called LoxP...
Evolutionary Relationships through Genome Comparisons
Homologous Recombination
Homologous Recombination
Gene Conversion
Exon Recombination
Exon shuffling follows “splice frame rules.” Each exon has three reading...

