Accurate assessment of fragment abundance within a genome is crucial in clinical genomics applications such as the analysis of copy number variation (CNV). However, this task is often hindered by biased coverage in regions with varying guanine-cytosine (GC) content. These biases are particularly exacerbated in hybridization capture sequencing due to GC effects on probe hybridization and polymerase chain reaction (PCR) amplification efficiency. Such GC content-associated variations can exert a negative impact on the fidelity of CNV calling within hybridization capture panels. In this report, we present panelGC, a novel metric, to quantify and monitor GC biases in hybridization capture sequencing data. We establish the efficacy of panelGC, demonstrating its proficiency in identifying and flagging potential procedural anomalies, even in situations where instrument and experimental monitoring data may not be readily accessible. Validation using real-world datasets demonstrates that panelGC enhances the quality control and reliability of hybridization capture panel sequencing.

MOTIVATION: Networks are used to relate topological structure to system dynamics and function, particularly in ecology systems biology. Network analysis is often guided or complemented by data-driven visualization. Hive one of many network visualizations, distinguish themselves as providing a general, consistent and coherent rule-based representation to motivate hypothesis development and testing. RESULTS: Here, we present HyPE, Hive Panel Explorer, a software application that creates a panel of interactive hive plots. HyPE enables network exploration based on user-driven layout rules and parameter combinations for simultaneous of multiple network views. We demonstrate HyPE's features by exploring a microbial co-occurrence network constructed from forest soil microbiomes. AVAILABILITY AND IMPLEMENTATION: HyPE is available under the GNU license: https://github.com/hallamlab/HivePanelExplorer. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

Motivation: The increase in publication rates makes it challenging for an individual researcher to stay abreast of all relevant research in order to find novel research hypotheses. Literature-based discovery methods make use of knowledge graphs built using text mining and can infer future associations between biomedical concepts that will likely occur in new publications. These predictions are a valuable resource for researchers to explore a research topic. Current methods for prediction are based on the local structure of the knowledge graph. A method that uses global knowledge from across the knowledge graph needs to be developed in order to make knowledge discovery a frequently used tool by researchers. Results: We propose an approach based on the singular value decomposition (SVD) that is able to combine data from across the knowledge graph through a reduced representation. Using cooccurrence data extracted from published literature, we show that SVD performs better than the leading methods for scoring discoveries. We also show the diminishing predictive power of knowledge discovery as we compare our predictions with real associations that appear further into the future. Finally, we examine the strengths and weaknesses of the SVD approach against another well-performing system using several predicted associations. Availability and implementation: All code and results files for this analysis can be accessed at https://github.com/jakelever/knowledgediscovery. Contact: [email protected]. Supplementary information: Supplementary data are available at Bioinformatics online.

Networks are typically visualized with force-based or spectral layouts. These algorithms lack reproducibility and perceptual uniformity because they do not use a node coordinate system. The layouts can be difficult to interpret and are unsuitable for assessing differences in networks. To address these issues, we introduce hive plots (http://www.hiveplot.com) for generating informative, quantitative and comparable network layouts. Hive plots depict network structure transparently, are simple to understand and can be easily tuned to identify patterns of interest. The method is computationally straightforward, scales well and is amenable to a plugin for existing tools.

MOTIVATION: A considerable amount of human intervention is currently required to produce high-quality fingerprint-based physical maps for genomic studies. RESULTS: An algorithm has been developed and implemented to automatically order fingerprinted clones within contigs. The resulting software, named CORAL (Clone ORdering ALgorithm), has been tested on maps that have previously been manually edited and on maps derived from in silico simulations. The fingerprint map and DNA sequence of the human genome has provided an additional test to CORAL. Measurements suggest that CORAL performs significantly better than the software currently used by most laboratories to order fingerprinted clones at throughputs far exceeding those that can be achieved manually.

SUMMARY: One of the more common uses of the program FingerPrint Contigs (FPC) is to assemble random restriction digest 'fingerprints' of overlapping genomic clones into contigs. To improve the rate of assembling contigs from large fingerprint databases we have adapted FPC so that it can be run in parallel on multiple processors and servers. The current version of 'parallelized FPC' has been used in our laboratory to assemble mammalian BAC fingerprint databases, each containing more than 300000 BAC fingerprints. AVAILABILITY: This parallelized version of FPC is available under the GNU GPL licence, and can be downloaded from ftp://ftp.bcgsc.bc.ca/pub/fpcd.