<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.2 20190208//EN" "https://jats.nlm.nih.gov/publishing/1.2/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" article-type="research-article" dtd-version="1.2" xml:lang="en">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">IJBC</journal-id>
<journal-title-group><journal-title>International Journal of Bioinformatics and Cheminformatics</journal-title></journal-title-group>
<publisher><publisher-name>Thomson &amp; Ryberg Publications</publisher-name></publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="doi">10.62715/ijbc.2026.v1.i1.pp14-19</article-id>
<article-id pub-id-type="publisher-id">2537d31356</article-id>
<article-categories><subj-group subj-group-type="heading"><subject>Methodology Article</subject></subj-group></article-categories>
<title-group><article-title>A Reproducible Pipeline for Scaffold-Hopping Across Public Compound Libraries</article-title></title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes"><name><surname>Larsen</surname><given-names>Liam</given-names></name><xref ref-type="aff" rid="aff1"><sup>1</sup></xref><xref ref-type="corresp" rid="cor1">*</xref></contrib>
<contrib contrib-type="author"><name><surname>Jovanovic</surname><given-names>Tuan</given-names></name><xref ref-type="aff" rid="aff2"><sup>2</sup></xref></contrib>
<contrib contrib-type="author"><name><surname>Ribeiro</surname><given-names>Kevin</given-names></name><xref ref-type="aff" rid="aff3"><sup>3</sup></xref></contrib>
<aff id="aff1"><label>1</label>Department of Life Sciences, Zambezi Institute of Life Sciences, Kyrgyzstan</aff>
<aff id="aff2"><label>2</label>Department of Life Sciences, Balkan Institute of Life Sciences, Philippines</aff>
<aff id="aff3"><label>3</label>Department of Life Sciences, Mekong Center for Life Sciences, Trinidad and Tobago</aff>
</contrib-group>
<author-notes><corresp id="cor1">* Correspondence: <email>liam.larsen@zambezi.edu</email></corresp></author-notes>
<pub-date pub-type="epub" iso-8601-date="2026-06-22"><day>22</day><month>06</month><year>2026</year></pub-date>
<volume>1</volume>
<issue>1</issue>
<fpage>14</fpage>
<lpage>19</lpage>
<history>
<date date-type="received" iso-8601-date="2026-02-24"><day>24</day><month>02</month><year>2026</year></date>
<date date-type="accepted" iso-8601-date="2026-04-28"><day>28</day><month>04</month><year>2026</year></date>
</history>
<permissions><copyright-statement>© 2026 The Author(s)</copyright-statement><copyright-year>2026</copyright-year><license license-type="open-access" xlink:href="https://creativecommons.org/licenses/by/4.0/"><license-p>This is an open access article distributed under the Creative Commons Attribution 4.0 International License (CC BY 4.0).</license-p></license></permissions>
<self-uri xlink:href="https://trpub.org/article.php?id=2537d31356"/>
<abstract><p>Scaffold hopping, the search for a different molecular framework that presents similar features to a biological target, is a routine task in medicinal chemistry and an awkward one to reproduce. Published searches differ in the library snapshot used, in how structures were standardised, in which similarity measure was applied and in where the cut-off was placed, and those choices are often described too loosely for another group to repeat the work. This article proposes a pipeline that fixes each of those choices explicitly and records them as machine-readable provenance alongside the result. The procedure has seven stages: define the query framework, assemble and version the public libraries, standardise structures with a published curation sequence, enumerate candidate frameworks, score candidates with three complementary measures of similarity, apply chemistry filters, and publish the ranked list together with everything needed to regenerate it. Each stage is described with the decision it requires, the open software that can perform it and the record it should leave. The pipeline is a proposal assembled from published methods and curation guidance. It has not been applied or validated here, and the article states what would have to be demonstrated before it could be recommended without reservation.</p></abstract>
<kwd-group kwd-group-type="author">
<kwd>Scaffold hopping</kwd>
<kwd>Reproducibility</kwd>
<kwd>Chemical structure curation</kwd>
<kwd>Virtual screening</kwd>
<kwd>Public compound libraries</kwd>
<kwd>Provenance</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="sec1"><title>1. Introduction</title>
<p>A scaffold hop replaces the central framework of an active compound while keeping the arrangement of groups that the target recognises. The motive is usually practical: to escape a patent, to improve metabolic stability, to shed a liability carried by the original core. The term was given its current sense by Schneider et al. (1999), who searched for topologically distinct molecules with matching pharmacophore features, and the strategy was reviewed as a discipline of its own by Bohm et al. (2004).</p>
<p>Public compound collections have made the search cheap. PubChem (Kim et al., 2023), ChEMBL (Gaulton et al., 2012; Mendez et al., 2019) and ZINC (Irwin et al., 2020) together offer hundreds of millions of structures with no licence cost. What has not kept pace is the reproducibility of searches made in them. Two groups starting from the same active compound and the same nominal library routinely produce different hit lists, and the reasons are mundane rather than scientific: a different database release, a different treatment of salts and tautomers, a different fingerprint radius, an unstated threshold.</p>
<p>This article proposes a pipeline designed so that a scaffold-hopping search can be repeated exactly by a reader with no access to the original authors. Nothing in it is novel as chemistry; the contribution is the assembly, the explicit recording of every choice that affects the result, and the attention given to the points where published searches most often become irreproducible. The pipeline is a proposal. It has not been run on a real programme here, and no results are reported.</p>
</sec>
<sec id="sec2"><title>2. Why Scaffold-Hopping Searches Resist Repetition</title>
<p>Three properties of the task make it fragile. The first is that the object being searched for is defined by negation. A useful hit must be similar in the features that matter and dissimilar in the framework, so the search depends on two thresholds pulling in opposite directions, and small movements in either reshape the output. The second is that the frameworks themselves must be derived from the structures, usually by the rule of Bemis and Murcko (1996), which strips side chains to leave ring systems and the linkers between them. That rule is deterministic, but what it is applied to is not: a structure with an unresolved tautomer or an attached counter-ion yields a different framework.</p>
<p>The third is that public libraries are moving targets. Records are added, corrected and withdrawn, and a search described as having been run against a named database is not reproducible unless the release is identified. The curation problem was set out plainly by Fourches et al. (2010), who showed how often errors in structure representation propagate into modelling results, and an open implementation of a defensible curation sequence is described by Bento et al. (2020).</p>
</sec>
<sec id="sec3"><title>3. Choosing Measures of Similarity</title>
<p>No single measure captures what a medicinal chemist means by a scaffold hop, so the pipeline uses three and treats disagreement between them as informative rather than as noise. Table 1 lists the measures with what each one treats as similar and the role it plays. Circular fingerprints (Rogers and Hahn, 2010) supply a topological baseline; a pharmacophore-type description captures the feature arrangement that motivated the original work of Schneider et al. (1999); and a three-dimensional shape comparison of the kind evaluated by Hawkins et al. (2007) tests whether the candidate can occupy the same volume as the original.</p>
<table-wrap id="tbl1"><label>Table 1</label><caption><p>Measures of similarity used in the pipeline and the role of each</p></caption><table frame="hsides" rules="groups"><thead><tr><th>Measure</th><th>What it treats as similar</th><th>Role in the pipeline</th></tr></thead><tbody><tr><td>Circular fingerprint overlap</td><td>Shared atom neighbourhoods up to a set radius</td><td>Baseline; also used in reverse to enforce framework difference</td></tr><tr><td>Murcko framework identity</td><td>The same ring systems and linkers</td><td>Defines what counts as a different scaffold (Bemis and Murcko, 1996)</td></tr><tr><td>Pharmacophore feature pairs</td><td>Equivalent features at equivalent distances</td><td>Carries the recognition hypothesis (Schneider et al., 1999)</td></tr><tr><td>Shape and colour overlay</td><td>Volume and feature overlap of aligned conformers</td><td>Three-dimensional check on the two-dimensional hits</td></tr><tr><td>Matched molecular pair context</td><td>Frameworks exchanged in known compound pairs</td><td>Evidence that the replacement has precedent</td></tr><tr><td>Activity cliff awareness</td><td>Close analogues with divergent potency</td><td>Warns where similarity is a poor guide (Stumpfe and Bajorath, 2012)</td></tr></tbody></table></table-wrap>
<p>The reverse use of the fingerprint deserves comment. A candidate is required to fall below a stated topological similarity to the query, because a hit that is merely a close analogue is not a hop. Setting that lower bound is the single most consequential parameter in the whole procedure and the one most often left unstated in published work.</p>
</sec>
<sec id="sec4"><title>4. The Proposed Pipeline</title>
<p>Seven stages follow, shown in Figure 1 and described in turn. Each stage writes a file, and the files together are the provenance record: given them, the search can be regenerated without reference to the people who ran it. Orchestration can use any workflow manager that records container images and parameter values, with a system such as the one described by Di Tommaso et al. (2017) a common choice, and software versions pinned through a package channel rather than described in prose.</p>
<fig id="fig1"><label>Figure 1</label><caption><p>The seven stages of the proposed scaffold-hopping pipeline</p></caption><graphic xlink:href="IJBC_V1I1_2026_03_Figure1.png" mimetype="image" mime-subtype="png"/></fig>
<sec id="sec4-2"><title>4.1. Stage 1: Define the query framework</title>
<p>The query is not a compound but a hypothesis about it. The chemist records the active structure, the framework obtained from it by the Bemis and Murcko rule, which atoms carry the features believed to be recognised by the target, and which part of the molecule is to be replaced. Writing this down separates the chemistry hypothesis from the computation, so that a disappointing hit list can be traced to the hypothesis rather than blamed on the software.</p>
</sec>
<sec id="sec4-3"><title>4.2. Stage 2: Assemble and version the libraries</title>
<p>Each source is downloaded as a dated release, and the release identifier, the file checksum and the record count are stored. Where a subset is used, the selection query is stored with it rather than described in prose. Mixing sources is expected, since bioactivity-annotated collections and purchasable catalogues serve different purposes, but the origin of every record is kept so that a hit can be traced back to the database that supplied it.</p>
</sec>
<sec id="sec4-4"><title>4.3. Stage 3: Standardise structures</title>
<p>Curation follows a fixed sequence: remove counter-ions and solvents, neutralise where the convention requires it, normalise functional group representations, choose a canonical tautomer, discard records that fail valence checks, and deduplicate on a canonical identifier. The standard InChI (Heller et al., 2015) is suitable as the deduplication key, and canonical SMILES (Weininger, 1988) as the working representation. The sequence itself matters: neutralise before tautomer selection and the outcome differs. The implementation of Bento et al. (2020) can be used as published, and whichever sequence is chosen it is recorded as an ordered list of operations rather than as the word curated.</p>
</sec>
<sec id="sec4-5"><title>4.4. Stage 4: Enumerate candidate frameworks</title>
<p>Frameworks are extracted from every standardised structure and counted, which turns a library of millions of compounds into a much smaller set of distinct cores. The search then runs over frameworks rather than over compounds, which is both faster and closer to the question being asked. Frameworks identical to the query are set aside at this point, as are those whose topological similarity to the query exceeds the stated upper bound.</p>
</sec>
<sec id="sec4-6"><title>4.5. Stage 5: Score with three measures</title>
<p>Each surviving framework, decorated with the substituents implied by the query hypothesis, is scored on the three measures of Table 1. Conformers for the shape comparison are generated with a stated method and a fixed random seed, since conformer generation is stochastic and an unseeded run cannot be repeated. The three scores are kept separate. Combining them into one number is convenient and discards the disagreement that is often the most interesting part of the output.</p>
</sec>
<sec id="sec4-7"><title>4.6. Stage 6: Apply chemistry filters</title>
<p>Filters remove what a chemist would reject on sight: reactive and unstable groups, structures outside the intended property range, and frequently flagged interference substructures of the kind catalogued by Baell and Holloway (2010). Those filters are heuristics and are applied as annotations rather than as silent deletions, so that a reviewer can see what was excluded and why. Commercial availability or synthetic accessibility can be annotated at the same stage without being used to rank.</p>
</sec>
<sec id="sec4-8"><title>4.7. Stage 7: Publish the list with its provenance</title>
<p>The deliverable is the ranked list together with the query definition, the library releases and checksums, the curation sequence, every threshold, the software versions and seeds, and the filter annotations. Deposited in a repository that issues a persistent identifier, this package satisfies the reuse expectations set out in the FAIR principles (Wilkinson et al., 2016) and makes the search repeatable by a stranger.</p>
</sec>
</sec>
<sec id="sec5"><title>5. Fitting the Pipeline to Ordinary Practice</title>
<p>The procedure is intended to run on a workstation rather than a cluster. Framework enumeration is the expensive stage and it is done once per library release, after which the framework table can be reused across projects. The chemistry filters and the shape comparison run only on the shortlist. Most of the stages can be built from RDKit (Landrum, 2006) with modest scripting, and groups already using a workflow manager will find the provenance requirements largely satisfied by their existing configuration files.</p>
<p>The discipline the pipeline imposes is mostly social rather than technical. It asks a group to fix thresholds before seeing the hit list, to keep every intermediate file, and to publish choices that are currently buried in a scientist&#x27;s notebook. Groups that adopt it will find the first search slower than usual and later searches faster, because the standardised library and framework tables persist.</p>
</sec>
<sec id="sec6"><title>6. Limitations and What Remains to Be Shown</title>
<p>This article proposes a procedure and does not evaluate it. Three claims would need testing. The first is retrospective recovery: whether, starting from one member of a pair of chemotypes known from the literature to bind the same target, the pipeline places the other high in the ranking more often than a single-measure search. The second is reproducibility in the strict sense, namely whether two groups given only the provenance package produce the same list. The third is the cost of the discipline, measured as the extra effort a group spends against the number of irreproducible searches avoided.</p>
<p>Two cautions apply regardless. Similarity is a weak guide to activity, and closely related structures with sharply different potency are common enough to have their own literature (Stumpfe and Bajorath, 2012), so a high-ranking framework is a hypothesis to be tested and never a result. And a pipeline can only be as good as the chemistry hypothesis entered at stage one; recording that hypothesis explicitly makes its weakness visible, which is a benefit rather than a defect.</p>
</sec>
<sec id="sec7"><title>7. Conclusion</title>
<p>Scaffold hopping across public libraries is cheap to attempt and difficult to repeat, and the difficulty lies in undocumented choices rather than in the chemistry. The seven-stage pipeline proposed here fixes the library release, the curation sequence, the similarity measures, the thresholds and the random seeds, keeps the three similarity scores separate, and publishes the provenance alongside the hit list. Whether it recovers known chemotype pairs better than simpler searches, and whether the provenance package is sufficient for independent repetition, are open questions that the groups running such searches are well placed to answer.</p>
</sec>
<sec id="sec8"><title>Conflict of interest</title>
<p>To be declared by the author(s) before publication.</p>
</sec>
<sec id="sec9"><title>Funding</title>
<p>To be declared by the author(s) before publication.</p>
</sec>
</body>
<back>
<ref-list><title>References</title>
<ref id="ref1"><label>1</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Baell, J.B. and Holloway, G.A.</string-name></person-group> (<year>2010</year>). <article-title>New substructure filters for removal of pan assay interference compounds (PAINS) from screening libraries and for their exclusion in bioassays</article-title>. <source>Journal of Medicinal Chemistry</source>, <volume>53(7)</volume>, <fpage>2719-2740</fpage></mixed-citation></ref>
<ref id="ref2"><label>2</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Bemis, G.W. and Murcko, M.A.</string-name></person-group> (<year>1996</year>). <article-title>The properties of known drugs. 1. Molecular frameworks</article-title>. <source>Journal of Medicinal Chemistry</source>, <volume>39(15)</volume>, <fpage>2887-2893</fpage></mixed-citation></ref>
<ref id="ref3"><label>3</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Bento, A.P., Hersey, A., Felix, E., Landrum, G., Gaulton, A., Atkinson, F., Bellis, L.J., De Veij, M. and Leach, A.R.</string-name></person-group> (<year>2020</year>). <article-title>An open source chemical structure curation pipeline using RDKit</article-title>. <source>Journal of Cheminformatics</source>, <volume>12(1)</volume>, <fpage>51</fpage></mixed-citation></ref>
<ref id="ref4"><label>4</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Bohm, H.-J., Flohr, A. and Stahl, M.</string-name></person-group> (<year>2004</year>). <article-title>Scaffold hopping</article-title>. <source>Drug Discovery Today: Technologies</source>, <volume>1(3)</volume>, <fpage>217-224</fpage></mixed-citation></ref>
<ref id="ref5"><label>5</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Di Tommaso, P., Chatzou, M., Floden, E.W., Barja, P.P., Palumbo, E. and Notredame, C.</string-name></person-group> (<year>2017</year>). <article-title>Nextflow enables reproducible computational workflows</article-title>. <source>Nature Biotechnology</source>, <volume>35(4)</volume>, <fpage>316-319</fpage></mixed-citation></ref>
<ref id="ref6"><label>6</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Fourches, D., Muratov, E. and Tropsha, A.</string-name></person-group> (<year>2010</year>). <article-title>Trust, but verify: On the importance of chemical structure curation in cheminformatics and QSAR modeling research</article-title>. <source>Journal of Chemical Information and Modeling</source>, <volume>50(7)</volume>, <fpage>1189-1204</fpage></mixed-citation></ref>
<ref id="ref7"><label>7</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Gaulton, A., Bellis, L.J., Bento, A.P., Chambers, J., Davies, M., Hersey, A., Light, Y., McGlinchey, S., Michalovich, D., Al-Lazikani, B. and Overington, J.P.</string-name></person-group> (<year>2012</year>). <article-title>ChEMBL: A large-scale bioactivity database for drug discovery</article-title>. <source>Nucleic Acids Research</source>, <volume>40(D1)</volume>, <fpage>D1100-D1107</fpage></mixed-citation></ref>
<ref id="ref8"><label>8</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Hawkins, P.C.D., Skillman, A.G. and Nicholls, A.</string-name></person-group> (<year>2007</year>). <article-title>Comparison of shape-matching and docking as virtual screening tools</article-title>. <source>Journal of Medicinal Chemistry</source>, <volume>50(1)</volume>, <fpage>74-82</fpage></mixed-citation></ref>
<ref id="ref9"><label>9</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Heller, S.R., McNaught, A., Pletnev, I., Stein, S. and Tchekhovskoi, D.</string-name></person-group> (<year>2015</year>). <article-title>InChI, the IUPAC International Chemical Identifier</article-title>. <source>Journal of Cheminformatics</source>, <volume>7</volume>, <fpage>23</fpage></mixed-citation></ref>
<ref id="ref10"><label>10</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Irwin, J.J., Tang, K.G., Young, J., Dandarchuluun, C., Wong, B.R., Khurelbaatar, M., Moroz, Y.S., Mayfield, J. and Sayle, R.A.</string-name></person-group> (<year>2020</year>). <article-title>ZINC20: A free ultralarge-scale chemical database for ligand discovery</article-title>. <source>Journal of Chemical Information and Modeling</source>, <volume>60(12)</volume>, <fpage>6065-6073</fpage></mixed-citation></ref>
<ref id="ref11"><label>11</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Kim, S., Chen, J., Cheng, T., Gindulyte, A., He, J., He, S., Li, Q., Shoemaker, B.A., Thiessen, P.A., Yu, B., Zaslavsky, L., Zhang, J. and Bolton, E.E.</string-name></person-group> (<year>2023</year>). <article-title>PubChem 2023 update</article-title>. <source>Nucleic Acids Research</source>, <volume>51(D1)</volume>, <fpage>D1373-D1380</fpage></mixed-citation></ref>
<ref id="ref12"><label>12</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Landrum, G.</string-name></person-group> (<year>2006</year>). <article-title>RDKit: Open-source cheminformatics software</article-title>. <source>RDKit project</source></mixed-citation></ref>
<ref id="ref13"><label>13</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Mendez, D., Gaulton, A., Bento, A.P., Chambers, J., De Veij, M., Felix, E., Magarinos, M.P., Mosquera, J.F., Mutowo, P., Nowotka, M., Gordillo-Maranon, M., Hunter, F., Junco, L., Mugumbate, G., Rodriguez-Lopez, M., Atkinson, F., Bosc, N., Radoux, et al.</string-name></person-group> (<year>2019</year>). <article-title>ChEMBL: Towards direct deposition of bioassay data</article-title>. <source>Nucleic Acids Research</source>, <volume>47(D1)</volume>, <fpage>D930-D940</fpage></mixed-citation></ref>
<ref id="ref14"><label>14</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Rogers, D. and Hahn, M.</string-name></person-group> (<year>2010</year>). <article-title>Extended-connectivity fingerprints</article-title>. <source>Journal of Chemical Information and Modeling</source>, <volume>50(5)</volume>, <fpage>742-754</fpage> <ext-link ext-link-type="uri" xlink:href="https://doi.org/10.1021/ci100050t">https://doi.org/10.1021/ci100050t</ext-link></mixed-citation></ref>
<ref id="ref15"><label>15</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Schneider, G., Neidhart, W., Giller, T. and Schmid, G.</string-name></person-group> (<year>1999</year>). <article-title>Scaffold-hopping by topological pharmacophore search: A contribution to virtual screening</article-title>. <source>Angewandte Chemie International Edition</source>, <volume>38(19)</volume>, <fpage>2894-2896</fpage></mixed-citation></ref>
<ref id="ref16"><label>16</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Stumpfe, D. and Bajorath, J.</string-name></person-group> (<year>2012</year>). <article-title>Exploring activity cliffs in medicinal chemistry</article-title>. <source>Journal of Medicinal Chemistry</source>, <volume>55(7)</volume>, <fpage>2932-2942</fpage></mixed-citation></ref>
<ref id="ref17"><label>17</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Weininger, D.</string-name></person-group> (<year>1988</year>). <article-title>SMILES, a chemical language and information system. 1. Introduction to methodology and encoding rules</article-title>. <source>Journal of Chemical Information and Computer Sciences</source>, <volume>28(1)</volume>, <fpage>31-36</fpage></mixed-citation></ref>
<ref id="ref18"><label>18</label><mixed-citation publication-type="other"><person-group person-group-type="author"><string-name>Wilkinson, M.D., Dumontier, M., Aalbersberg, I.J., Appleton, G., Axton, M., Baak, A., Blomberg, N., Boiten, J.-W., da Silva Santos, L.B., Bourne, P.E., Bouwman, J., Brookes, A.J., Clark, T., Crosas, M., Dillo, I., Dumon, O., Edmunds, S., Evelo, et al.</string-name></person-group> (<year>2016</year>). <article-title>The FAIR Guiding Principles for scientific data management and stewardship</article-title>. <source>Scientific Data</source>, <volume>3</volume>, <fpage>160018</fpage></mixed-citation></ref>
</ref-list>
</back>
</article>