MOTIVATION: One of the standard methods of high-throughput RNA sequencing analysis is differential expression. However, it does not detect changes in molecular regulation. In contrast to the standard differential expression analysis, differential co-expression one aims to detect pairs or clusters whose mutual expression changes between two conditions. RESULTS: We developed Differential Co-expression Network Analysis (DCoNA)-an open-source statistical tool that allows one to identify pair interactions, which correlation significantly changes between two conditions. Comparing DCoNA with the state-of-the-art analog, we showed that DCoNA is a faster, more accurate and less memory-consuming tool. We applied DCoNA to prostate mRNA/miRNA-seq data collected from The Cancer Genome Atlas (TCGA) and compared predicted regulatory interactions of miRNA isoforms (isomiRs) and their target mRNAs between normal and cancer samples. As a result, almost all highly expressed isomiRs lost negative correlation with their targets in prostate cancer samples compared to ones without the pathology. One exception to this trend was the canonical isomiR of hsa-miR-93-5p acquiring cancer-specific targets. Further analysis showed that cancer aggressiveness simultaneously increased with the expression level of this isomiR in both TCGA primary tumor samples and 153 blood plasma samples of P. Hertsen Moscow Oncology Research Institute patients' cohort analyzed by miRNA microarrays. AVAILABILITY AND IMPLEMENTATION: Source code and documentation of DCoNA are available at https://github.com/zhiyanov/DCoNA. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Several performance measures can be used for evaluating classification results: accuracy, F-measure, and many others. Can we say that some of them are better than others, or, ideally, choose one measure that is best in all situations? To answer this question, we conduct a systematic analysis of classification performance measures: we formally define a list of desirable properties and theoretically analyze which measures satisfy which properties. We also prove an impossibility theorem: some desirable properties cannot be simultaneously satisfied. Finally, we propose a new family of measures satisfying all desirable properties except one. This family includes the Matthews Correlation Coefficient and a so-called Symmetric Balanced Accuracy that was not previously used in classification literature. We believe that our systematic approach gives an important tool to practitioners for adequately evaluating classification results.

We are interested in learning algorithms that optimize revenue in repeated contextual posted-price auctions where a single seller faces a single strategic buyer. In our setting, the buyer maximizes his expected cumulative discounted surplus, and his valuation of a good is assumed to be a fixed function of a $d$-dimensional context (feature) vector. We introduce a novel deterministic learning algorithm that is based on ideas of the Bisection method and has strategic regret upper bound of $O(\log^2 T)$. Unlike previous works, our algorithm does not require any assumption on the distribution of context information, and the regret guarantee holds for any realization of feature vectors (adversarial upper bound). To construct our algorithm we non-trivially adopted techniques of integral geometry to act against buyer strategicness and improved the penalization trick to work in contextual auctions.