Repeat Detector: versatile sizing of expanded tandem repeats and identification of interrupted alleles from targeted DNA sequencing.

Targeted DNA sequencing approaches will improve how the size of short tandem repeats is measured for diagnostic tests and preclinical studies. The expansion of these sequences causes dozens of disorders, with longer tracts generally leading to a more severe disease. Interrupted alleles are sometimes present within repeats and can alter disease manifestation. Determining repeat size mosaicism and identifying interruptions in targeted sequencing datasets remains a major challenge. This is in part because standard alignment tools are ill-suited for repetitive and unstable sequences. To address this, we have developed Repeat Detector (RD), a deterministic profile weighting algorithm for counting repeats in targeted sequencing data. We tested RD using blood-derived DNA samples from Huntington's disease and Fuchs endothelial corneal dystrophy patients sequenced using either Illumina MiSeq or Pacific Biosciences single-molecule, real-time sequencing platforms. RD was highly accurate in determining repeat sizes of 609 blood-derived samples from Huntington's disease individuals and did not require prior knowledge of the flanking sequences. Furthermore, RD can be used to identify alleles with interruptions and provide a measure of repeat instability within an individual. RD is therefore highly versatile and may find applications in the diagnosis of expanded repeat disorders and in the development of novel therapies.

Attracting cavities for docking. Replacing the rough energy landscape of the protein by a smooth attracting landscape.

Molecular docking is a computational approach for predicting the most probable position of ligands in the binding sites of macromolecules and constitutes the cornerstone of structure-based computer-aided drug design. Here, we present a new algorithm called Attracting Cavities that allows molecular docking to be performed by simple energy minimizations only. The approach consists in transiently replacing the rough potential energy hypersurface of the protein by a smooth attracting potential driving the ligands into protein cavities. The actual protein energy landscape is reintroduced in a second step to refine the ligand position. The scoring function of Attracting Cavities is based on the CHARMM force field and the FACTS solvation model. The approach was tested on the 85 experimental ligand-protein structures included in the Astex diverse set and achieved a success rate of 80% in reproducing the experimental binding mode starting from a completely randomized ligand conformer. The algorithm thus compares favorably with current state-of-the-art docking programs.

pfsearchV3: a code acceleration and heuristic to search PROSITE profiles.

SUMMARY: The PROSITE resource provides a rich and well annotated source of signatures in the form of generalized profiles that allow protein domain detection and functional annotation. One of the major limiting factors in the application of PROSITE in genome and metagenome annotation pipelines is the time required to search protein sequence databases for putative matches. We describe an improved and optimized implementation of the PROSITE search tool pfsearch that, combined with a newly developed heuristic, addresses this limitation. On a modern x86_64 hyper-threaded quad-core desktop computer, the new pfsearchV3 is two orders of magnitude faster than the original algorithm. AVAILABILITY AND IMPLEMENTATION: Source code and binaries of pfsearchV3 are freely available for download at http://web.expasy.org/pftools/#pfsearchV3, implemented in C and supported on Linux. PROSITE generalized profiles including the heuristic cut-off scores are available at the same address.