Day two of APBC: Invited talks
Wednesday, January 14th, 2009The morning session today started with two invited talks:
Bailin Hao: Independent verification of 16S rRNA based prokaryotic phylogeny by composition vector approach
The first one was a bit strange. The presentation consisted of reading the slides aloud and the topic was never really completely clear to me.
They had, apparently, constructed a phylogeny for prokaryotes using a new method called CVTree — essentially neighbour-joining but with a distance measure based on K-mer statistics and thus parameter and alignment free — and compared that with the tree of life 16S RNA phylogeny and the taxonomy.
The talk was mainly bashing the taxonomy for having classes that are not monophylitic, but there wasn’t much on actual tree comparisons of the tree hierarchies/phylogenies.
Pavel Pevzner: Genome rearrangements: from biological problems to combinatorial algorithms
The second talk, on the other hand, was absolutely great.
Pevzner first warned us that he would give a more “computer science” talk than most of the talks so far, and would prove three theorems (one of which would be wrong).
He took three controversial biological problems
- Do rodents and primates group, with carnivores as an outgroup, or do primates and carnivores group with rodents as an outgroup
- Does the mamalian genome contain rearrangement hotspots or are rearrangements randomly distributed
- Was there a whole genome duplication in yeast
and he reduced these questions to combinatorial problems that can be tested
- Ancestral genome reconstruction
- Breakpoint re-use analysis
- The genome halving problem
The first problem is essentially a matter of constructing a parsimony tree based on rearrangement events, and he showed that that favoured the ((carnivore,primate),rodent) topology.
The second problem was a question on putting a lower bound on the number of rearrangement events between human and mouse and showing that this lower bound was greater than the observed number of breakpoints, which means that some breakpoints must have been reused.
Time ran out before he could talk about the third problem, so I don’t know what the results are there.
I would have preferred if he had been given more time, ’cause it was really interesting.
The incorrect theorem, by the way, was in a proof for the number of steps needed in transposition sorting, which complicated the results on the second problem.
–
14-19 = -5


