PubMed Health⌕ Search

PubMed · 12774691

Virtual screening of virtual libraries.

Abstract

Virtual screening of virtual libraries (VSVL) is a rapidly changing area of research. Great efforts are being made to produce better algorithms, selection methods and infrastructure. Yet, the number of successful examples in the literature is not impressive, although the quality of work certainly is high. Why is this? One reason is that these methods tend to be applied at the lead generation stage and therefore there is a large lead-time before successful examples appear in the literature. However, any computational chemist would confirm that these methods are successful and there exists a glut of start-up companies specialising in virtual screening. Moreover, the scientific community would not be focussing so much attention on this area if it were not yielding results. Even so, the paucity of literature data is certainly a hindrance to the development of better methods. The VSVL process is unique within the discovery process, in that it is the only method that can screen the > 10(30) genuinely novel molecules out there. Already, some VSVL methods are evaluating 10(13) compounds, a capacity that high throughput screening can only dream of. There is a huge potential advantage for the company that develops efficient and effective methods, for lead generation, lead hopping and optimization of both potency and ADME properties. To do this, it requires more than the software, it requires confidence to exploit the methodology, to commit synthesis on the basis of it, and to build this approach into the medicinal chemistry strategy. It is a fact that these tools remain quite daunting for the majority of scientists working at the bench. The routine use of these methods is not simply a matter of education and training. Integration of these methods into accessible and robust end user software, without dilution of the science, must be a priority. We have reached a coincidence, where several technologies have the required level of maturity predictive computational chemistry methods, algorithms that manage the combinatorial explosion, high throughput crystallography and ADME measurements and the massive increase in computational horsepower from distributed computing. The author is confident that the synergy of these technologies will bring great benefit to the industry, with more efficient production of higher quality clinical candidates. The future is bright. The future is virtual!

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Darren V S Green. 2003. Virtual screening of virtual libraries.. https://doi.org/10.1016/s0079-6468(02)41002-8

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related citations

A note on a generalized single step theory for any number of hierarchical genomic matrices.

BACKGROUND: The Single Step algorithm allows combining information from genotyped and un-genotyped individuals, provided they are connected by a pedigree. However, current single step theory is limited to a single list of markers. RESULTS: We present a generalized single step (GSS) method that can accommodate any number of hierarchical molecular datasets (e.g. sequence, high and low density arrays) and pedigree, avoiding imputation. We prove that a similar efficient inversion algorithm exists. The method is recursive, starting with the highest marker density scenario. We illustrate the method with simulation and show that GSS can increase predictive accuracy compared to standard single step. R code is provided so that custom scenarios can be easily compared, either with simulated or real data. CONCLUSION: The method developed generalizes extant single step theory to any number of hierarchical molecular relationship matrices, broadening the scenarios where single step can be applied. A topic of particular interest can be ecology field data or human populations where pedigree is not available, but where samples sequenced and genotyped at different densities can exist. GSS can also be a useful tool to optimize allocation of genotyping and / or sequencing resources.

Algorithms↗

cgDist: Nucleotide-level distance calculation from cgMLST allelic profiles.

Bacterial genomic surveillance requires balancing computational efficiency with genetic resolution for effective cluster investigation. cgMLST distance calculations treat all allelic differences as equivalent units, obscuring nucleotide-level variation. Furthermore, single nucleotide polymorphism-based pipelines provide finer resolution at substantially higher computational cost, which limits their routine deployment in surveillance laboratories. We present cgDist, an algorithm that calculates nucleotide-level distances directly from cgMLST allelic profiles, providing finer resolution than allele-count distances by leveraging within-allele nucleotide variation. The cache architecture stores alignment statistics, enabling distance calculation modes without computation and supporting both dataset-specific and schema-complete cache generation. This design enables incremental surveillance analysis, with performance benefits as laboratories accumulate alignment data. cgDist functions as a precision 'zoom lens' for the investigation of clusters identified through initial cgMLST screening. Rather than restructuring population relationships, this targeted approach concentrates enhanced resolution where it is most informative. The algorithm ensures that cgDist distances are greater than or equal to corresponding cgMLST distances, preserving epidemiological interpretability while adding genetic discrimination. By increasing resolution within identified clusters, cgDist may also support outbreak investigation, a potential application that remains to be evaluated on outbreak-derived data.

Algorithms↗

Theseus: fast and optimal affine-gap sequence-to-graph alignment.

MOTIVATION: Sequence-to-graph alignment is a central problem in bioinformatics, with applications in multiple sequence alignment (MSA) and pangenome analysis, among others. However, current algorithms for optimal affine-gap alignment impose high memory and computational requirements, limiting their scalability to aligning long sequences to complex graphs. Practical solutions partially address this problem using heuristic strategies that ultimately trade off optimality for speed. RESULTS: This work presents Theseus, a novel, fast, and optimal affine-gap sequence-to-graph alignment algorithm. Theseus leverages similarities between genomic sequences to accelerate the alignment computation and reduces the overall memory requirements without compromising optimality. To that end, Theseus processes only a subset of the dynamic programming cells, using a sparse-data strategy that enables efficient sequence-to-graph alignment. Moreover, our algorithm supports optimal affine-gap alignment on arbitrary directed graphs, including those with cycles. We evaluate Theseus on two key problems: MSA and pangenome read mapping. For MSA, we compare it against SPOA, abPOA, and POASTA. Theseus is 1.6× to 17.6× faster than POASTA, and 7.3× faster, on average, than SPOA, both optimal aligners. Compared with abPOA, Theseus ensures optimality and scales to the largest problems. For pangenome read mapping, we benchmark Theseus against the alignment stage of the mapping tool vg map, along with the alignment kernels of SPOA, abPOA, and POASTA. Theseus outperforms the other methods, showing a 1.9× to 16.9× speedup on short reads. Moreover, Theseus is 1.5× to 36.3× faster than vg when aligning against synthetic cyclic graphs. AVAILABILITY AND IMPLEMENTATION: Theseus code and documentation are publicly available at https://github.com/albertjimenezbl/theseus-lib.

Algorithms↗