SUMMARY: Reverse-Phase Protein Array (RPPA) is a robust high-throughput, cost-effective platform for quantitatively measuring proteins in biological specimens. However, converting raw RPPA data into normalized, analysis-ready data remains a challenging task. Here, we present the RPPA SPACE (RPPA Superposition Analysis and Concentration Evaluation) R package, a substantially improved successor to SuperCurve, to meet that challenge. SuperCurve has been used to normalize over 170 000 samples to date. RPPA SPACE allows exclusion of poor-quality samples from the normalization process to improve the quality of the remaining samples. It also features a novel quality-control metric, 'noise', that estimates the level of random errors present in each RPPA slide. The noise metric can help to determine the quality and reliability of the data. In addition, RPPA SPACE has simpler input requirements and is more flexible than SuperCurve, it is much faster with greatly improved error reporting. AVAILABILITY AND IMPLEMENTATION: The standalone RPPA SPACE R package, tutorials and sample data are available via https://rppa.space/, CRAN (https://cran.r-project.org/web/packages/RPPASPACE/index.html) and GitHub (https://github.com/MD-Anderson-Bioinformatics/RPPASPACE). SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

MOTIVATION: Network-based analyses of high-throughput genomics data provide a holistic, systems-level understanding of various biological mechanisms for a common population. However, when estimating multiple networks across heterogeneous sub-populations, varying sample sizes pose a challenge in the estimation and inference, as network differences may be driven by differences in power. We are particularly interested in addressing this challenge in the context of proteomic networks for related cancers, as the number of subjects available for rare cancer (sub-)types is often limited. RESULTS: We develop NExUS (Network Estimation across Unequal Sample sizes), a Bayesian method that enables joint learning of multiple networks while avoiding artefactual relationship between sample size and network sparsity. We demonstrate through simulations that NExUS outperforms existing network estimation methods in this context, and apply it to learn network similarity and shared pathway activity for groups of cancers with related origins represented in The Cancer Genome Atlas (TCGA) proteomic data. AVAILABILITY AND IMPLEMENTATION: The NExUS source code is freely available for download at https://github.com/priyamdas2/NExUS. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

SUMMARY: Here we present a browser-based Semi-Automated Metabolic Map Illustrator (SAMMI) for the visualization of metabolic networks. While automated features allow for easy network partitioning, navigation, and node positioning, SAMMI also offers a wide array of manual map editing features. This combination allows for fast, context-specific visualization of metabolic networks as well as the development of standardized, large-scale, visually appealing maps. The implementation of SAMMI with popular constraint-based modeling toolboxes also allows for effortless visualization of simulation results of genome-scale metabolic models. AVAILABILITY AND IMPLEMENTATION: SAMMI has been implemented as a standalone web-based tool and as plug-ins for the COBRA and COBRApy toolboxes. SAMMI and its COBRA plugins are available under the GPL 3.0 license and are available along with documentation, tutorials, and source code at www.SammiTool.com. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

MOTIVATION: Molecular pathways and networks play a key role in basic and disease biology. An emerging notion is that networks encoding patterns of molecular interplay may themselves differ between contexts, such as cell type, tissue or disease (sub)type. However, while statistical testing of differences in mean expression levels has been extensively studied, testing of network differences remains challenging. Furthermore, since network differences could provide important and biologically interpretable information to identify molecular subgroups, there is a need to consider the unsupervised task of learning subgroups and networks that define them. This is a nontrivial clustering problem, with neither subgroups nor subgroup-specific networks known at the outset. RESULTS: We leverage recent ideas from high-dimensional statistics for testing and clustering in the network biology setting. The methods we describe can be applied directly to most continuous molecular measurements and networks do not need to be specified beforehand. We illustrate the ideas and methods in a case study using protein data from The Cancer Genome Atlas (TCGA). This provides evidence that patterns of interplay between signalling proteins differ significantly between cancer types. Furthermore, we show how the proposed approaches can be used to learn subtypes and the molecular networks that define them. AVAILABILITY AND IMPLEMENTATION: As the Bioconductor package nethet. CONTACT: [email protected] or [email protected]. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

MOTIVATION: High-throughput reverse-phase protein array (RPPA) technology allows for the parallel measurement of protein expression levels in approximately 1000 samples. However, the many steps required in the complex protocol (sample lysate preparation, slide printing, hybridization, washing and amplified detection) may create substantial variability in data quality. We are not aware of any other quality control algorithm that is tuned to the special characteristics of RPPAs. RESULTS: We have developed a novel classifier for quality control of RPPA experiments using a generalized linear model and logistic function. The outcome of the classifier, ranging from 0 to 1, is defined as the probability that a slide is of good quality. After training, we tested the classifier using two independent validation datasets. We conclude that the classifier can distinguish RPPA slides of good quality from those of poor quality sufficiently well such that normalization schemes, protein expression patterns and advanced biological analyses will not be drastically impacted by erroneous measurements or systematic variations. AVAILABILITY AND IMPLEMENTATION: The classifier, implemented in the "SuperCurve" R package, can be freely downloaded at http://bioinformatics.mdanderson.org/main/OOMPA:Overview or http://r-forge.r-project.org/projects/supercurve/. The data used to develop and validate the classifier are available at http://bioinformatics.mdanderson.org/MOAR.

Reputation systems (RS) are designed to detect malicious nodes in a network and thwart their attacks, such as the spreading of viruses or worms, or attacking known vulnerabilities. They do this by collecting information about past transactions of a node and utilizing that to predict its future behavior. Traditionally, RSs have been designed by manually devising specific models or equations that use historical data to defend against certain types of attacks. In this paper, we propose a machine learning based RS that automates the process of devising the RS model and defends against many patterns of attacks. We discuss the merits of this approach and propose using support vector machines as the basis of the RS. We delineated the factors associated with building the SVM based RS and then proposed and evaluated our technique. We compared the performance of our RS with another RS found in the literature, called TrustGuard, and showed that our RS significantly outperforms TrustGuard. Our RS correctly distinguishes between good and malicious nodes with high accuracy, even when the proportion of malicious nodes in the network is very high.

The goal of this research is to develop a basis for utilizing efficient encryption schemes in wireless communications and in devices with low computing power and resources. Elliptic curve cryptography (ECC) fits well for an efficient and secure encryption scheme. It is more efficient than the ubiquitous RSA based schemes because ECC utilizes smaller key sizes for equivalent security. A comparative study of ECC with RSA is made in terms of key size, computational power, size of data files and encrypted files. Also, another aim is to design an API to implement ECC encryption/decryption algorithm.