Mutation accumulation in Tetrahymena

Background - The rate and fitness effects of mutations are key in understanding the evolution of every species. Traditionally, these parameters are estimated in mutation accumulation experiments where replicate lines are propagated in conditions that allow mutations to randomly accumulate without the purging effect of natural selection. These experiments have been performed with many model organisms but we still lack empirical estimates of the rate and effects of mutation in the protists. Results - We performed a mutation accumulation (MA) experiment in Tetrahymena thermophila, a species that can reproduce sexually and asexually in nature, and measured both the mean decline and variance increase in fitness of 20 lines. The results obtained with T. thermophila were compared with T. pyriformis that is an obligate asexual species. We show that MA lines of T. thermophila go to extinction at a rate of 1.25 clonal extinctions per bottleneck. In contrast, populations of T. pyriformis show a much higher resistance to extinction. Variation in gene copy number is likely to be a key factor in explaining these results, and indeed we show that T. pyriformis has a higher mean copy number per cell than T. thermophila. From fitness measurements during the MA experiment, we infer a rate of mutation to copy number variation of 0.0333 per haploid MAC genome of T. thermophila and a mean effect against copy number variation of 0.16. A strong effect of population size in the rate of fitness decline was also found, consistent with the increased power of natural selection. Conclusions - The rate of clonal extinction measured for T. thermophila is characteristic of a mutational degradation and suggests that this species must undergo sexual reproduction to avoid the deleterious effects detected in the laboratory experiments. We also suggest that an increase in chromosomal copy number associated with the phenotypic assortment of amitotic divisions can provide an alternative mechanism to escape the deleterious effect of random chromosomal copy number variation in species like T. pyriformis that lack the resetting mechanism of sexual reproduction. Our results are relevant to the understanding of cell line longevity and senescence in ciliates.

Probabilistic consensus clustering using evidence accumulation

Clustering ensemble methods produce a consensus partition of a set of data points by combining the results of a collection of base clustering algorithms. In the evidence accumulation clustering (EAC) paradigm, the clustering ensemble is transformed into a pairwise co-association matrix, thus avoiding the label correspondence problem, which is intrinsic to other clustering ensemble schemes. In this paper, we propose a consensus clustering approach based on the EAC paradigm, which is not limited to crisp partitions and fully exploits the nature of the co-association matrix. Our solution determines probabilistic assignments of data points to clusters by minimizing a Bregman divergence between the observed co-association frequencies and the corresponding co-occurrence probabilities expressed as functions of the unknown assignments. We additionally propose an optimization algorithm to find a solution under any double-convex Bregman divergence. Experiments on both synthetic and real benchmark data show the effectiveness of the proposed approach.

A MAP approach to evidence accumulation clustering

The Evidence Accumulation Clustering (EAC) paradigm is a clustering ensemble method which derives a consensus partition from a collection of base clusterings obtained using different algorithms. It collects from the partitions in the ensemble a set of pairwise observations about the co-occurrence of objects in a same cluster and it uses these co-occurrence statistics to derive a similarity matrix, referred to as co-association matrix. The Probabilistic Evidence Accumulation for Clustering Ensembles (PEACE) algorithm is a principled approach for the extraction of a consensus clustering from the observations encoded in the co-association matrix based on a probabilistic model for the co-association matrix parameterized by the unknown assignments of objects to clusters. In this paper we extend the PEACE algorithm by deriving a consensus solution according to a MAP approach with Dirichlet priors defined for the unknown probabilistic cluster assignments. In particular, we study the positive regularization effect of Dirichlet priors on the final consensus solution with both synthetic and real benchmark data.