We then build a set of N pairwise alignments between the ancestor A and its N descendants. Each one of these obtains a likelihood function log L as given in equation 6. Now we create a new likelihood function log L* which is the sum of the N log likelihoods. If is the number of expected identities of type t in region r between the ancestral sequence A and its n th descendant, then our assumption of independence implies that