Somatic structural variants (SVs), which are variants that typically impact >50 nucleotides, play a significant role in cancer development and evolution but are notoriously more difficult to detect than small variants from short-read next-generation sequencing (NGS) data. This is due to a combination of challenges attributed to the purity of tumour samples, tumour heterogeneity, limitations of short-read information from NGS and sequence alignment ambiguities. In spite of active development of SV detection tools (callers) over the past few years, each method has inherent advantages and limitations. In this review, we highlight some of the important factors affecting somatic SV detection and compared the performance of seven commonly used SV callers. In particular, we focus on the extent of change in sensitivity and precision for detecting different SV types and size ranges from samples with differing variant allele frequencies and sequencing depths of coverage. We highlight the reasons for why some SV callers perform well in some settings but not others, allowing our evaluation findings to be extended beyond the seven SV callers examined in this paper. As the importance of large SVs become increasingly recognized in cancer genomics, this paper provides a timely review on some of the most impactful factors influencing somatic SV detection that should be considered when choosing SV callers.

MOTIVATION: We present PCIT, an algorithm for the reconstruction of gene co-expression networks (GCN) that combines the concept partial correlation coefficient with information theory to identify significant gene to gene associations defining edges in the reconstruction of GCN. The properties of PCIT are examined in the context of the topology of the reconstructed network including connectivity structure, clustering coefficient and sensitivity. RESULTS: We apply PCIT to a series of simulated datasets with varying levels of complexity in terms of number of genes and experimental conditions, as well as to three real datasets. Results show that, as opposed to the constant cutoff approach commonly used in the literature, the PCIT algorithm can identify and allow for more moderate, yet not less significant, estimates of correlation (r) to still establish a connection in the GCN. We show that PCIT is more sensitive than established methods and capable of detecting functionally validated gene-gene interactions coming from absolute r values as low as 0.3. These bona fide associations, which often relate to genes with low variation in expression patterns, are beyond the detection limits of conventional fixed-threshold methods, and would be overlooked by studies relying on those methods. AVAILABILITY: FORTRAN 90 source code to perform the PCIT algorithm is available as Supplementary File 1.