Wesley Schaal
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Wesley Schaal has a total of 117 co-authors. Here are the top co-authors by number of shared publications:
- Ola Spjuth
Department of Pharmaceutical Biosciences, Uppsala University, Uppsala, Sweden
10 shared publications Anders Hallberg
Department of Medicinal Chemistry, Organic Pharmaceutical Chemistry, Uppsala University, Box 574, SE-751 23, Uppsala, Sweden
9 shared publicationsAnders Karlén
Department of Medicinal Chemistry, Uppsala University, BMC Box 574, SE-751 23 Uppsala, Sweden
8 shared publicationsBertil Samuelsson
6 shared publicationsBjörn Classon
Department of Organic Chemistry, Stockholm University, Sweden
4 shared publications- Jonathan Alvarsson
Department of Pharmaceutical Biosciences and Science for Life Laboratory, Uppsala University
4 shared publications
Latest Publications
- Open Access
- 4 August 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 7130
Precise mapping of single-stranded DNA breaks by sequence-templated erroneous DNA polymerase end-labelling
The ability to analyze whether DNA contains lesions is essential in identifying mutagenic substances. Currently, the detection of single-stranded DNA breaks (SSBs) lacks precision. To address this limitation, we develop a method for sequence-templated erroneous end-labelling sequencing (STEEL-seq), which enables the mapping of SSBs. The method requires a highly error-prone DNA polymerase, so we engineer a chimeric DNA polymerase, Sloppymerase, capable of replicating DNA in the absence of one nucleotide. Following the omission of a specific nucleotide (e.g., dATP) from the reaction mixture, Sloppymerase introduces mismatches directly downstream of SSBs at positions where deoxyadenosine should occur. This mismatch pattern, coupled with the retention of sequence information flanking these sites, ensures that the identified hits are bona fide SSBs. STEEL-seq is compatible with a variety of sequencing technologies, as demonstrated using Sanger, Illumina, PacBio, and Nanopore systems. Using STEEL-seq, we determine the SSB/base pair frequency in the human genome to range between 0.7 and 3.8 × 10−6 with an enrichment in active promoter regions.
- 4 August 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 7130
Open AccessPrecise mapping of single-stranded DNA breaks by sequence-templated erroneous DNA polymerase end-labelling
The ability to analyze whether DNA contains lesions is essential in identifying mutagenic substances. Currently, the detection of single-stranded DNA breaks (SSBs) lacks precision. To address this limitation, we develop a method for sequence-templated erroneous end-labelling sequencing (STEEL-seq), which enables the mapping of SSBs. The method requires a highly error-prone DNA polymerase, so we engineer a chimeric DNA polymerase, Sloppymerase, capable of replicating DNA in the absence of one nucleotide. Following the omission of a specific nucleotide (e.g., dATP) from the reaction mixture, Sloppymerase introduces mismatches directly downstream of SSBs at positions where deoxyadenosine should occur. This mismatch pattern, coupled with the retention of sequence information flanking these sites, ensures that the identified hits are bona fide SSBs. STEEL-seq is compatible with a variety of sequencing technologies, as demonstrated using Sanger, Illumina, PacBio, and Nanopore systems. Using STEEL-seq, we determine the SSB/base pair frequency in the human genome to range between 0.7 and 3.8 × 10−6 with an enrichment in active promoter regions.
- Open Access
- 15 July 2022
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 14 (1) , 1-12
Predicting protein network topology clusters from chemical structure using deep learning
Comparing chemical structures to infer protein targets and functions is a common approach, but basing comparisons on chemical similarity alone can be misleading. Here we present a methodology for predicting target protein clusters using deep neural networks. The model is trained on clusters of compounds based on similarities calculated from combined compound-protein and protein-protein interaction data using a network topology approach. We compare several deep learning architectures including both convolutional and recurrent neural networks. The best performing method, the recurrent neural network architecture MolPMoFiT, achieved an F1 score approaching 0.9 on a held-out test set of 8907 compounds. In addition, in-depth analysis on a set of eleven well-studied chemical compounds with known functions showed that predictions were justifiable for all but one of the chemicals. Four of the compounds, similar in their molecular structure but with dissimilarities in their function, revealed advantages of our method compared to using chemical similarity.
- 15 July 2022
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 14 (1) , 1-12
Open AccessPredicting protein network topology clusters from chemical structure using deep learning
Comparing chemical structures to infer protein targets and functions is a common approach, but basing comparisons on chemical similarity alone can be misleading. Here we present a methodology for predicting target protein clusters using deep neural networks. The model is trained on clusters of compounds based on similarities calculated from combined compound-protein and protein-protein interaction data using a network topology approach. We compare several deep learning architectures including both convolutional and recurrent neural networks. The best performing method, the recurrent neural network architecture MolPMoFiT, achieved an F1 score approaching 0.9 on a held-out test set of 8907 compounds. In addition, in-depth analysis on a set of eleven well-studied chemical compounds with known functions showed that predictions were justifiable for all but one of the chemicals. Four of the compounds, similar in their molecular structure but with dissimilarities in their function, revealed advantages of our method compared to using chemical similarity.
- Open Access
- 15 October 2020
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 12 (1) , 1-11
Predicting target profiles with confidence as a service using docking scores
Background: Identifying and assessing ligand-target binding is a core component in early drug discovery as one or more unwanted interactions may be associated with safety issues.Contributions: We present an open-source, extendable web service for predicting target profiles with confidence using machine learning for a panel of 7 targets, where models are trained on molecular docking scores from a large virtual library. The method uses conformal prediction to produce valid measures of prediction efficiency for a particular confidence level. The service also offers the possibility to dock chemical structures to the panel of targets with QuickVina on individual compound basis.Results: The docking procedure and resulting models were validated by docking well-known inhibitors for each of the 7 targets using QuickVina. The model predictions showed comparable performance to molecular docking scores against an external validation set. The implementation as publicly available microservices on Kubernetes ensures resilience, scalability, and extensibility.
- 15 October 2020
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 12 (1) , 1-11
Open AccessPredicting target profiles with confidence as a service using docking scores
Background: Identifying and assessing ligand-target binding is a core component in early drug discovery as one or more unwanted interactions may be associated with safety issues.Contributions: We present an open-source, extendable web service for predicting target profiles with confidence using machine learning for a panel of 7 targets, where models are trained on molecular docking scores from a large virtual library. The method uses conformal prediction to produce valid measures of prediction efficiency for a particular confidence level. The service also offers the possibility to dock chemical structures to the panel of targets with QuickVina on individual compound basis.Results: The docking procedure and resulting models were validated by docking well-known inhibitors for each of the 7 targets using QuickVina. The model predictions showed comparable performance to molecular docking scores against an external validation set. The implementation as publicly available microservices on Kubernetes ensures resilience, scalability, and extensibility.
- Open Access
- 25 September 2020
- Published by Springer Nature in Research Square
Predicting Target Profiles with Confidence as a Service using Docking Scores
Background: Identifying and assessing ligand-target binding is a core component in early drug discovery asone or more unwanted interactions may be associated with safety issues.Contributions: We present an open-source, extendable web service for predicting target profiles withconfidence using machine learning for a panel of 7 targets, where models are trained on molecular dockingscores from a large virtual library. The method uses conformal prediction to produce valid measures ofprediction efficiency for a particular confidence level. The service also offers the possibility to dock chemicalstructures to the panel of targets with QuickVina on individual compound basis.Results: The docking procedure and resulting models were validated by docking well-known inhibitors for eachof the 7 targets using QuickVina. The model predictions showed comparable performance to molecular dockingscores against an external validation set. The implementation as publicly available microservices on Kubernetesensures resilience, scalability, and extensibility
- 25 September 2020
- Published by Springer Nature in Research Square
Open AccessPredicting Target Profiles with Confidence as a Service using Docking Scores
Background: Identifying and assessing ligand-target binding is a core component in early drug discovery asone or more unwanted interactions may be associated with safety issues.Contributions: We present an open-source, extendable web service for predicting target profiles withconfidence using machine learning for a panel of 7 targets, where models are trained on molecular dockingscores from a large virtual library. The method uses conformal prediction to produce valid measures ofprediction efficiency for a particular confidence level. The service also offers the possibility to dock chemicalstructures to the panel of targets with QuickVina on individual compound basis.Results: The docking procedure and resulting models were validated by docking well-known inhibitors for eachof the 7 targets using QuickVina. The model predictions showed comparable performance to molecular dockingscores against an external validation set. The implementation as publicly available microservices on Kubernetesensures resilience, scalability, and extensibility
- Open Access
- 1 October 2018
- Published by Centers for Disease Control and Prevention (CDC) in Emerging Infectious Diseases
- Vol. 24 (10) , 1874-1881
Rapid Increase in Carriage Rates ofEnterobacteriaceaeProducing Extended-Spectrum β-Lactamases in Healthy Preschool Children, Sweden
By collecting and analyzing diapers, we identified a >6-fold increase in carriage of extended-spectrum beta-lactamase (ESBL)-producing Enterobacteriaceae for healthy preschool children in Sweden (p= 40%. We analyzed samples from 334 children and found 56 containing >= 1 ESBL producer. The prevalence in the study population increased from 2.6% in 2010 to 16.8% in 2016 (p= 40%. Furthermore, 58% of the ESBL producers were multidrug resistant, and transmission of ESBL-producing and non-ESBL-producing strains was observed at several of the preschools. Toddlers appear to be major carriers of ESBL producers in Sweden.
- 1 October 2018
- Published by Centers for Disease Control and Prevention (CDC) in Emerging Infectious Diseases
- Vol. 24 (10) , 1874-1881
Open AccessRapid Increase in Carriage Rates ofEnterobacteriaceaeProducing Extended-Spectrum β-Lactamases in Healthy Preschool Children, Sweden
By collecting and analyzing diapers, we identified a >6-fold increase in carriage of extended-spectrum beta-lactamase (ESBL)-producing Enterobacteriaceae for healthy preschool children in Sweden (p= 40%. We analyzed samples from 334 children and found 56 containing >= 1 ESBL producer. The prevalence in the study population increased from 2.6% in 2010 to 16.8% in 2016 (p= 40%. Furthermore, 58% of the ESBL producers were multidrug resistant, and transmission of ESBL-producing and non-ESBL-producing strains was observed at several of the preschools. Toddlers appear to be major carriers of ESBL producers in Sweden.
- Open Access
- 5 April 2018
- Published by Oxford University Press (OUP) in GigaScience
- Vol. 7 (5)
Tracking the NGS revolution: managing life science research on shared high-performance computing clusters
Background: Next-generation sequencing (NGS) has transformed the life sciences, and many research groups are newly dependent upon computer clusters to store and analyze large datasets. This creates challenges for e-infrastructures accustomed to hosting computationally mature research in other sciences. Using data gathered from our own clusters at UPPMAX computing center at Uppsala University, Sweden, where core hour usage of ~800 NGS and ~200 non-NGS projects is now similar, we compare and contrast the growth, administrative burden, and cluster usage of NGS projects with projects from other sciences. Results: The number of NGS projects has grown rapidly since 2010, with growth driven by entry of new research groups. Storage used by NGS projects has grown more rapidly since 2013 and is now limited by disk capacity. NGS users submit nearly twice as many support tickets per user, and 11 more tools are installed each month for NGS projects than for non-NGS projects. We developed usage and efficiency metrics and show that computing jobs for NGS projects use more RAM than non-NGS projects, are more variable in core usage, and rarely span multiple nodes. NGS jobs use booked resources less efficiently for a variety of reasons. Active monitoring can improve this somewhat. Conclusions: Hosting NGS projects imposes a large administrative burden at UPPMAX due to large numbers of inexperienced users and diverse and rapidly evolving research areas. We provide a set of recommendations for e-infrastructures that host NGS research projects. We provide anonymized versions of our storage, job, and efficiency databases.
- 5 April 2018
- Published by Oxford University Press (OUP) in GigaScience
- Vol. 7 (5)
Open AccessTracking the NGS revolution: managing life science research on shared high-performance computing clusters
Background: Next-generation sequencing (NGS) has transformed the life sciences, and many research groups are newly dependent upon computer clusters to store and analyze large datasets. This creates challenges for e-infrastructures accustomed to hosting computationally mature research in other sciences. Using data gathered from our own clusters at UPPMAX computing center at Uppsala University, Sweden, where core hour usage of ~800 NGS and ~200 non-NGS projects is now similar, we compare and contrast the growth, administrative burden, and cluster usage of NGS projects with projects from other sciences. Results: The number of NGS projects has grown rapidly since 2010, with growth driven by entry of new research groups. Storage used by NGS projects has grown more rapidly since 2013 and is now limited by disk capacity. NGS users submit nearly twice as many support tickets per user, and 11 more tools are installed each month for NGS projects than for non-NGS projects. We developed usage and efficiency metrics and show that computing jobs for NGS projects use more RAM than non-NGS projects, are more variable in core usage, and rarely span multiple nodes. NGS jobs use booked resources less efficiently for a variety of reasons. Active monitoring can improve this somewhat. Conclusions: Hosting NGS projects imposes a large administrative burden at UPPMAX due to large numbers of inexperienced users and diverse and rapidly evolving research areas. We provide a set of recommendations for e-infrastructures that host NGS research projects. We provide anonymized versions of our storage, job, and efficiency databases.
- Open Access
- 3 April 2018
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 10 (1) , 1-10
A confidence predictor for logD using conformal regression and a support-vector machine
Lipophilicity is a major determinant of ADMET properties and overall suitability of drug candidates. We have developed large-scale models to predict water–octanol distribution coefficient (logD) for chemical compounds, aiding drug discovery projects. Using ACD/logD data for 1.6 million compounds from the ChEMBL database, models are created and evaluated by a support-vector machine with a linear kernel using conformal prediction methodology, outputting prediction intervals at a specified confidence level. The resulting model shows a predictive ability of $$\hbox {Q}^{2}=0.973$$ and with the best performing nonconformity measure having median prediction interval of $$\pm ~0.39$$ log units at 80% confidence and $$\pm ~0.60$$ log units at 90% confidence. The model is available as an online service via an OpenAPI interface, a web page with a molecular editor, and we also publish predictive values at 90% confidence level for 91 M PubChem structures in RDF format for download and as an URI resolver service.- 3 April 2018
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 10 (1) , 1-10
Open AccessA confidence predictor for logD using conformal regression and a support-vector machine
Lipophilicity is a major determinant of ADMET properties and overall suitability of drug candidates. We have developed large-scale models to predict water–octanol distribution coefficient (logD) for chemical compounds, aiding drug discovery projects. Using ACD/logD data for 1.6 million compounds from the ChEMBL database, models are created and evaluated by a support-vector machine with a linear kernel using conformal prediction methodology, outputting prediction intervals at a specified confidence level. The resulting model shows a predictive ability of $$\hbox {Q}^{2}=0.973$$ and with the best performing nonconformity measure having median prediction interval of $$\pm ~0.39$$ log units at 80% confidence and $$\pm ~0.60$$ log units at 90% confidence. The model is available as an online service via an OpenAPI interface, a web page with a molecular editor, and we also publish predictive values at 90% confidence level for 91 M PubChem structures in RDF format for download and as an URI resolver service. - Open Access
- 1 March 2018
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 10 (1) , 8-8:8
Efficient iterative virtual screening with Apache Spark and conformal prediction
Docking and scoring large libraries of ligands against target proteins forms the basis of structure-based virtual screening. The problem is trivially parallelizable, and calculations are generally carried out on computer clusters or on large workstations in a brute force manner, by docking and scoring all available ligands. In this study we propose a strategy that is based on iteratively docking a set of ligands to form a training set, training a ligand-based model on this set, and predicting the remainder of the ligands to exclude those predicted as ‘low-scoring’ ligands. Then, another set of ligands are docked, the model is retrained and the process is repeated until a certain model efficiency level is reached. Thereafter, the remaining ligands are docked or excluded based on this model. We use SVM and conformal prediction to deliver valid prediction intervals for ranking the predicted ligands, and Apache Spark to parallelize both the docking and the modeling. We show on 4 different targets that conformal prediction based virtual screening (CPVS) is able to reduce the number of docked molecules by 62.61% while retaining an accuracy for the top 30 hits of 94% on average and a speedup of 3.7. The implementation is available as open source via GitHub ( https://github.com/laeeq80/spark-cpvs ) and can be run on high-performance computers as well as on cloud resources.
- 1 March 2018
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 10 (1) , 8-8:8
Open AccessEfficient iterative virtual screening with Apache Spark and conformal prediction
Docking and scoring large libraries of ligands against target proteins forms the basis of structure-based virtual screening. The problem is trivially parallelizable, and calculations are generally carried out on computer clusters or on large workstations in a brute force manner, by docking and scoring all available ligands. In this study we propose a strategy that is based on iteratively docking a set of ligands to form a training set, training a ligand-based model on this set, and predicting the remainder of the ligands to exclude those predicted as ‘low-scoring’ ligands. Then, another set of ligands are docked, the model is retrained and the process is repeated until a certain model efficiency level is reached. Thereafter, the remaining ligands are docked or excluded based on this model. We use SVM and conformal prediction to deliver valid prediction intervals for ranking the predicted ligands, and Apache Spark to parallelize both the docking and the modeling. We show on 4 different targets that conformal prediction based virtual screening (CPVS) is able to reduce the number of docked molecules by 62.61% while retaining an accuracy for the top 30 hits of 94% on average and a speedup of 3.7. The implementation is available as open source via GitHub ( https://github.com/laeeq80/spark-cpvs ) and can be run on high-performance computers as well as on cloud resources.
- 1 July 2017
- Published by Elsevier in Journal of Hospital Infection
- Vol. 96 (3) , 256-261
High frequency of silver resistance genes in invasive isolates of Enterobacter and Klebsiella species
- 1 July 2017
- Published by Elsevier in Journal of Hospital Infection
- Vol. 96 (3) , 256-261
High frequency of silver resistance genes in invasive isolates of Enterobacter and Klebsiella species
- Open Access
- 6 March 2017
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 9 (1) , 15-15:6
Large-scale virtual screening on public cloud resources with Apache Spark
Structure-based virtual screening is an in-silico method to screen a target receptor against a virtual molecular library. Applying docking-based screening to large molecular libraries can be computationally expensive, however it constitutes a trivially parallelizable task. Most of the available parallel implementations are based on message passing interface, relying on low failure rate hardware and fast network connection. Google’s MapReduce revolutionized large-scale analysis, enabling the processing of massive datasets on commodity hardware and cloud resources, providing transparent scalability and fault tolerance at the software level. Open source implementations of MapReduce include Apache Hadoop and the more recent Apache Spark. We developed a method to run existing docking-based screening software on distributed cloud resources, utilizing the MapReduce approach. We benchmarked our method, which is implemented in Apache Spark, docking a publicly available target receptor against \(\sim \)2.2 M compounds. The performance experiments show a good parallel efficiency (87%) when running in a public cloud environment. Our method enables parallel Structure-based virtual screening on public cloud resources or commodity computer clusters. The degree of scalability that we achieve allows for trying out our method on relatively small libraries first and then to scale to larger libraries. Our implementation is named Spark-VS and it is freely available as open source from GitHub ( https://github.com/mcapuccini/spark-vs ). Graphical abstract .- 6 March 2017
- Published by Springer Nature in Journal of Cheminformatics
- Vol. 9 (1) , 15-15:6
Open AccessLarge-scale virtual screening on public cloud resources with Apache Spark
Structure-based virtual screening is an in-silico method to screen a target receptor against a virtual molecular library. Applying docking-based screening to large molecular libraries can be computationally expensive, however it constitutes a trivially parallelizable task. Most of the available parallel implementations are based on message passing interface, relying on low failure rate hardware and fast network connection. Google’s MapReduce revolutionized large-scale analysis, enabling the processing of massive datasets on commodity hardware and cloud resources, providing transparent scalability and fault tolerance at the software level. Open source implementations of MapReduce include Apache Hadoop and the more recent Apache Spark. We developed a method to run existing docking-based screening software on distributed cloud resources, utilizing the MapReduce approach. We benchmarked our method, which is implemented in Apache Spark, docking a publicly available target receptor against \(\sim \)2.2 M compounds. The performance experiments show a good parallel efficiency (87%) when running in a public cloud environment. Our method enables parallel Structure-based virtual screening on public cloud resources or commodity computer clusters. The degree of scalability that we achieve allows for trying out our method on relatively small libraries first and then to scale to larger libraries. Our implementation is named Spark-VS and it is freely available as open source from GitHub ( https://github.com/mcapuccini/spark-vs ). Graphical abstract .