Multiplierz: An Extensible API Based Desktop Environment for Proteomics Data Analysis

BACKGROUND. Efficient analysis of results from mass spectrometry-based proteomics experiments requires access to disparate data types, including native mass spectrometry files, output from algorithms that assign peptide sequence to MS/MS spectra, and annotation for proteins and pathways from various database sources. Moreover, proteomics technologies and experimental methods are not yet standardized; hence a high degree of flexibility is necessary for efficient support of high- and low-throughput data analytic tasks. Development of a desktop environment that is sufficiently robust for deployment in data analytic pipelines, and simultaneously supports customization for programmers and non-programmers alike, has proven to be a significant challenge. RESULTS. We describe multiplierz, a flexible and open-source desktop environment for comprehensive proteomics data analysis. We use this framework to expose a prototype version of our recently proposed common API (mzAPI) designed for direct access to proprietary mass spectrometry files. In addition to routine data analytic tasks, multiplierz supports generation of information rich, portable spreadsheet-based reports. Moreover, multiplierz is designed around a "zero infrastructure" philosophy, meaning that it can be deployed by end users with little or no system administration support. Finally, access to multiplierz functionality is provided via high-level Python scripts, resulting in a fully extensible data analytic environment for rapid development of custom algorithms and deployment of high-throughput data pipelines. CONCLUSION. Collectively, mzAPI and multiplierz facilitate a wide range of data analysis tasks, spanning technology development to biological annotation, for mass spectrometry-based proteomics research.Dana-Farber Cancer Institute; National Human Genome Research Institute (P50HG004233); National Science Foundation Integrative Graduate Education and Research Traineeship grant (DGE-0654108

Socioeconomic Inequalities in Mortality Rates in Old Age in the World Health Organization Europe Region

Socioeconomic adversity is among the foremost fundamental causes of human suffering, and this is no less true in old age. Recent reports on socioeconomic inequalities in mortality rate in old age suggest that a low socioeconomic position continues to increase the risk of death even among the oldest old. We aimed to examine the evidence for socioeconomic mortality rate inequalities in old age, including information about associations with various indicators of socioeconomic position and for various geographic locations within the World Health Organization Region for Europe. The articles included in this review leave no doubt that inequalities in mortality rate by socioeconomic position persist into the oldest ages for both men and women in all countries for which information is available, although the relative risk measures observed were rarely higher than 2.00. Still, the available evidence base is heavily biased geographically, inasmuch as it is based largely on national studies from Nordic and Western European countries and local studies from urban areas in Southern Europe. This bias will hamper the design of European-wide policies to reduce inequalities in mortality rate. We call for a continuous update of the empiric evidence on socioeconomic inequalities in mortality rate

10411 Abstracts Collection -- Computational Video

From 10.10.2010 to 15.10.2010, the Dagstuhl Seminar 10411 ``Computational Video \u27\u27 was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available

Scaling Analysis of Affinity Propagation

We analyze and exploit some scaling properties of the Affinity Propagation (AP) clustering algorithm proposed by Frey and Dueck (2007). First we observe that a divide and conquer strategy, used on a large data set hierarchically reduces the complexity ${\cal O}(N^2)$ to ${\cal O}(N^{(h+2)/(h+1)})$, for a data-set of size $N$ and a depth $h$ of the hierarchical strategy. For a data-set embedded in a $d$-dimensional space, we show that this is obtained without notably damaging the precision except in dimension $d=2$. In fact, for $d$ larger than 2 the relative loss in precision scales like $N^{(2-d)/(h+1)d}$. Finally, under some conditions we observe that there is a value $s^*$ of the penalty coefficient, a free parameter used to fix the number of clusters, which separates a fragmentation phase (for $s<s^*$) from a coalescent one (for $s>s^*$) of the underlying hidden cluster structure. At this precise point holds a self-similarity property which can be exploited by the hierarchical strategy to actually locate its position. From this observation, a strategy based on \AP can be defined to find out how many clusters are present in a given dataset.Comment: 28 pages, 14 figures, Inria research repor

Multiclass Semi-Supervised Learning on Graphs using Ginzburg-Landau Functional Minimization

We present a graph-based variational algorithm for classification of high-dimensional data, generalizing the binary diffuse interface model to the case of multiple classes. Motivated by total variation techniques, the method involves minimizing an energy functional made up of three terms. The first two terms promote a stepwise continuous classification function with sharp transitions between classes, while preserving symmetry among the class labels. The third term is a data fidelity term, allowing us to incorporate prior information into the model in a semi-supervised framework. The performance of the algorithm on synthetic data, as well as on the COIL and MNIST benchmark datasets, is competitive with state-of-the-art graph-based multiclass segmentation methods.Comment: 16 pages, to appear in Springer's Lecture Notes in Computer Science volume "Pattern Recognition Applications and Methods 2013", part of series on Advances in Intelligent and Soft Computin

Patchiness and Demographic Noise in Three Ecological Examples

Understanding the causes and effects of spatial aggregation is one of the most fundamental problems in ecology. Aggregation is an emergent phenomenon arising from the interactions between the individuals of the population, able to sense only -at most- local densities of their cohorts. Thus, taking into account the individual-level interactions and fluctuations is essential to reach a correct description of the population. Classic deterministic equations are suitable to describe some aspects of the population, but leave out features related to the stochasticity inherent to the discreteness of the individuals. Stochastic equations for the population do account for these fluctuation-generated effects by means of demographic noise terms but, owing to their complexity, they can be difficult (or, at times, impossible) to deal with. Even when they can be written in a simple form, they are still difficult to numerically integrate due to the presence of the "square-root" intrinsic noise. In this paper, we discuss a simple way to add the effect of demographic stochasticity to three classic, deterministic ecological examples where aggregation plays an important role. We study the resulting equations using a recently-introduced integration scheme especially devised to integrate numerically stochastic equations with demographic noise. Aimed at scrutinizing the ability of these stochastic examples to show aggregation, we find that the three systems not only show patchy configurations, but also undergo a phase transition belonging to the directed percolation universality class.Comment: 20 pages, 5 figures. To appear in J. Stat. Phy