Yes.
> 2.a. Previous messages suggest that this should be O(n) where n is the
> size of the tree. This is supposed to an optimal solution as well, and
> not an approximation, yes? So the simple greedy approach is
> insufficient....
Yes, optimal
> 3. Two things seem ambiguous. In order to compare the phylogenetic
> alignment and the sum-of-pairs alignment with the consensus sequence,
> you must define how to extract some sort of a single sequence from
> them for us to make different. In the phylogenetic alignment is it the
> sequence of the root? And in the sum-of-pairs, is it the consensus
> sequence of the alignment?
I am not sure I understand the question. The consensus string is the
most common letter in each column. The phylogeny alignment, the
strings at all nodes are all the same lengths (i.e. they contain
gaps).
-Mike
> Thanks,
> Orion
>>
>> 3. Two things seem ambiguous. In order to compare the phylogenetic
>> alignment and the sum-of-pairs alignment with the consensus sequence,
>> you must define how to extract some sort of a single sequence from
>> them for us to make different. In the phylogenetic alignment is it the
>> sequence of the root? And in the sum-of-pairs, is it the consensus
>> sequence of the alignment?
>
> I am not sure I understand the question. The consensus string is the
> most common letter in each column. The phylogeny alignment, the
> strings at all nodes are all the same lengths (i.e. they contain
> gaps).
Okay, so how do we say if the consensus string is the "same" or "different" from the phylogeny alignment or the sum-of-pairs alignment. It's comparing strings against alignments, which is not straightforward. It would be a tempting solution to say that they are always different, since one is a phylogeny alignment (labeled nodes), one is a sum-of-pairs alignment (n aligned sequences), and one is a single consensus sequence. How can they every be equal?
-M