title: The combinatorics of tandem duplication trees.
abstract: We developed a recurrence relation that counts the number of tandem duplication trees (either rooted or unrooted) that are consistent with a set of n tandemly repeated sequences generated under the standard unequal recombination (or crossover) model of tandem duplications. The number of rooted duplication trees is exactly twice the number of unrooted trees, which means that on average only two positions for a root on a duplication tree are possible. Using the recurrence, we tabulated these numbers for small values of n. We also developed an asymptotic formula that for large n provides estimates for these numbers. These numbers give a priori probabilities for phylogenies of the repeated sequences to be duplication trees. This work extends earlier studies where exhaustive counts of the numbers for small n were obtained. One application showed the significance of finding that most maximum-parsimony trees constructed from repeat sequences from human immunoglobins and T-cell receptors were tandem duplication trees. Those findings provided strong support to the proposed mechanisms of tandem gene duplication. The recurrence relation also suggests efficient algorithms to recognize duplication trees and to generate random duplication trees for simulation. We present a linear-time recognition algorithm.
authors.affiliation: Département d'Informatique Fondamentale et Applications, LIRMM, 161 Rue Ada, 34392 Montpellier, France.
authors.forename: Olivier
authors.initials: O
authors.lastname: Gascuel
authors.forename: Michael D
authors.initials: MD
authors.lastname: Hendy
authors.forename: Alain
authors.initials: A
authors.lastname: Jean-Marie
authors.forename: Robert
authors.initials: R
authors.lastname: McLachlan
mesh_terms: D000465:Algorithms; D020440:Gene Duplication; D015233:Models, Statistical; D010802:Phylogeny