**Speaker**: Libo Huang (黄力博), CAS-MPG Partner Institute for Computational Biology

**Date**: Sun, May 13, 2018

**Time**: 15:45 - 16:45

**Venue**: Middle Meeting Room

**Title**: The Bandelt-Dress quartet distance conjecture

**Abstract**:

A quartet is a binary tree with exact 4 leaves. In 1986, Bandelt and Dress raised the quartet distance conjecture which says that the ratio of the minimal number of similar quartets as displayed in any two phylogenetic trees divided by the the number of the total quartets will tend to 1/3 as the number of leaves tend to infinity. We show that the conjecture is true for caterpillar case and X-tree case and provide a new proof for the non-negative property of distance covariance. We also study the quartet comparison among three sequences with only one split in each sequence.

This is joint work with Stefan Grunewald.

**Slides**:
View slides