A Microscope Automated Fluidic System to Study Bacterial Processes in Real Time

Most time lapse microscopy experiments studying bacterial processes ie growth, progression through the cell cycle and motility have been performed on thin nutrient agar pads. An important limitation of this approach is that dynamic perturbations of the experimental conditions cannot be easily performed. In eukaryotic cell biology, fluidic approaches have been largely used to study the impact of rapid environmental perturbations on live cells and in real time. However, all these approaches are not easily applicable to bacterial cells because the substrata are in all cases specific and also because microfluidics nanotechnology requires a complex lithography for the study of micrometer sized bacterial cells. In fact, in many cases agar is the experimental solid substratum on which bacteria can move or even grow. For these reasons, we designed a novel hybrid micro fluidic device that combines a thin agar pad and a custom flow chamber. By studying several examples, we show that this system allows real time analysis of a broad array of biological processes such as growth, development and motility. Thus, the flow chamber system will be an essential tool to study any process that take place on an agar surface at the single cell level

Workflow and Atlas System for Brain-Wide Mapping of Axonal Connectivity in Rat

Detailed knowledge about the anatomical organization of axonal connections is important for understanding normal functions of brain systems and disease-related dysfunctions. Such connectivity data are typically generated in neuroanatomical tract-tracing experiments in which specific axonal connections are visualized in histological sections. Since journal publications typically only accommodate restricted data descriptions and example images, literature search is a cumbersome way to retrieve overviews of brain connectivity. To explore more efficient ways of mapping, analyzing, and sharing detailed axonal connectivity data from the rodent brain, we have implemented a workflow for data production and developed an atlas system tailored for online presentation of axonal tracing data. The system is available online through the Rodent Brain WorkBench (www.rbwb.org; Whole Brain Connectivity Atlas) and holds experimental metadata and high-resolution images of histological sections from experiments in which axonal tracers were injected in the primary somatosensory cortex. We here present the workflow and the data system, and exemplify how the online image repository can be used to map different aspects of the brain-wide connectivity of the rat primary somatosensory cortex, including not only presence of connections but also morphology, densities, and spatial organization. The accuracy of the approach is validated by comparing results generated with our system with findings reported in previous publications. The present study is a contribution to a systematic mapping of rodent brain connections and represents a starting point for further large-scale mapping efforts

PFClust : a novel parameter free clustering algorithm

Background: We present the algorithm PFClust (Parameter Free Clustering), which is able automatically to cluster data and identify a suitable number of clusters to group them into without requiring any parameters to be specified by the user. The algorithm partitions a dataset into a number of clusters that share some common attributes, such as their minimum expectation value and variance of intra-cluster similarity. A set of n objects can be clustered into any number of clusters from one to n, and there are many different hierarchical and partitional, agglomerative and divisive, clustering methodologies available that can be used to do this. Nonetheless, automatically determining the number of clusters present in a dataset constitutes a significant challenge for clustering algorithms. Identifying a putative optimum number of clusters to group the objects into involves computing and evaluating a range of clusterings with different numbers of clusters. However, there is no agreed or unique definition of optimum in this context. Thus, we test PFClust on datasets for which an external gold standard of 'correct' cluster definitions exists, noting that this division into clusters may be suboptimal according to other reasonable criteria. PFClust is heuristic in the sense that it cannot be described in terms of optimising any single simply-expressed metric over the space of possible clusterings. Results: We validate PFClust firstly with reference to a number of synthetic datasets consisting of 2D vectors, showing that its clustering performance is at least equal to that of six other leading methodologies -- even though five of the other methods are told in advance how many clusters to use. We also demonstrate the ability of PFClust to classify the three dimensional structures of protein domains, using a set of folds taken from the structural bioinformatics database CATH. Conclusions: We show that PFClust is able to cluster the test datasets a little better, on average, than any of the other algorithms, and furthermore is able to do this without the need to specify any external parameters. Results on the synthetic datasets demonstrate that PFClust generates meaningful clusters, while our algorithm also shows excellent agreement with the correct assignments for a dataset extracted from the CATH part-manually curated classification of protein domain structures.Publisher PDFPeer reviewe

Neighbourhood contrast : A better means to detect clusters than density

Most density-based clustering algorithms suffer from large density variations among clusters. This paper proposes a new measure called Neighbourhood Contrast (NC) as a better alternative to density in detecting clusters. The proposed NC admits all local density maxima, regardless of their densities, to have similar NC values. Due to this unique property, NC is a better means to detect clusters in a dataset with large density variations among clusters. We provide two applications of NC. First, replacing density with NC in the current state-of-the-art clustering procedure DP leads to significantly improved clustering performance. Second, we devise a new clustering algorithm called Neighbourhood Contrast Clustering (NCC) which does not require density or distance calculations, and therefore has a linear time complexity in terms of dataset size. Our empirical evaluation shows that both NC-based methods outperform density-based methods including the current state-of-the-art