BFF and cellhashR: analysis tools for accurate demultiplexing of cell hashing data.

MOTIVATION: Single-cell sequencing methods provide previously impossible resolution into the transcriptome of individual cells. Cell hashing reduces single-cell sequencing costs by increasing capacity on droplet-based platforms. Cell hashing methods rely on demultiplexing algorithms to accurately classify droplets; however, assumptions underlying these algorithms limit accuracy of demultiplexing, ultimately impacting the quality of single-cell sequencing analyses. RESULTS: We present Bimodal Flexible Fitting (BFF) demultiplexing algorithms BFFcluster and BFFraw, a novel class of algorithms that rely on the single inviolable assumption that barcode count distributions are bimodal. We integrated these and other algorithms into cellhashR, a new R package that provides integrated QC and a single command to execute and compare multiple demultiplexing algorithms. We demonstrate that BFFcluster demultiplexing is both tunable and insensitive to issues with poorly behaved data that can confound other algorithms. Using two well-characterized reference datasets, we demonstrate that demultiplexing with BFF algorithms is accurate and consistent for both well-behaved and poorly behaved input data. AVAILABILITY AND IMPLEMENTATION: cellhashR is available as an R package at https://github.com/BimberLab/cellhashR. cellhashR version 1.0.3 was used for the analyses in this manuscript and is archived on Zenodo at https://www.doi.org/10.5281/zenodo.6402477. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.

How to choose templates for modeling of protein complexes: Insights from benchmarking template-based docking.

Comparative docking is based on experimentally determined structures of protein-protein complexes (templates), following the paradigm that proteins with similar sequences and/or structures form similar complexes. Modeling utilizing structure similarity of target monomers to template complexes significantly expands structural coverage of the interactome. Template-based docking by structure alignment can be performed for the entire structures or by aligning targets to the bound interfaces of the experimentally determined complexes. Systematic benchmarking of docking protocols based on full and interface structure alignment showed that both protocols perform similarly, with top 1 docking success rate 26%. However, in terms of the models' quality, the interface-based docking performed marginally better. The interface-based docking is preferable when one would suspect a significant conformational change in the full protein structure upon binding, for example, a rearrangement of the domains in multidomain proteins. Importantly, if the same structure is selected as the top template by both full and interface alignment, the docking success rate increases 2-fold for both top 1 and top 10 predictions. Matching structural annotations of the target and template proteins for template detection, as a computationally less expensive alternative to structural alignment, did not improve the docking performance. Sophisticated remote sequence homology detection added templates to the pool of those identified by structure-based alignment, suggesting that for practical docking, the combination of the structure alignment protocols and the remote sequence homology detection may be useful in order to avoid potential flaws in generation of the structural templates library.

A vibrational entropy term for DNA docking with autodock.

DNA interacts with small molecules, from water to endogenous reactive oxygen and nitrogen species, environmental mutagens and carcinogens, and pharmaceutical anticancer molecules. Understanding and predicting the physical interactions of small molecules with DNA via docking is key not only for the comprehension of molecular-level events that lead to carcinogenesis and other diseases, but also for the rational design of drugs that target DNA. We recently validated AutoDock, a popular docking method that includes a physics-based scoring function and a Lamarckian Genetic Algorithm, for the prediction of small molecule geometries upon physical binding to DNA. In this work, we added a vibrational entropy term based on the docking frequency to the scoring function in order to improve the accuracy of the best (lowest) score geometry. We found that in four small molecule-DNA systems the inclusion of the vibrational entropy term decreased the root-mean-square-deviation from the experimental crystallographic structure. Including the entropy term also preserved the successful prediction of the binding geometry compared to the crystallographic structure for the rest of the small molecule-DNA systems. We also improved the method of creating clusters of docking geometries and emphasized the importance of the length of the search process for similar vibrational entropy terms.