// SPDX-FileCopyrightText: 2026 Filip Leonarski, Paul Scherrer Institute // SPDX-License-Identifier: GPL-3.0-only #include "ClashRelief.h" #include "SideChainRotamers.h" #include #include #include #include namespace { constexpr double REACH = 4.0; // A: the farthest pair that can overlap (OverlapOf) } // namespace std::vector RelieveSideChainClashes(gemmi::Structure &st) { std::vector turned; const gemmi::SpaceGroup *sg = st.find_spacegroup(); if (sg == nullptr || st.models.empty()) return turned; gemmi::Model &model = st.models[0]; gemmi::UnitCell cell = st.cell; cell.set_cell_images_from_spacegroup(sg); // The atoms a LINK joins are no clash of each other. std::vector> links; for (const gemmi::Connection &conn : st.connections) { const gemmi::CRA a = model.find_cra(conn.partner1), b = model.find_cra(conn.partner2); if (a.atom != nullptr && b.atom != nullptr) links.emplace_back(a.atom, b.atom); } // One pass over the model after another, until no side chain moves: a side chain turned out of a copy that the // pass had still to turn made its choice against that copy's old place, so in the later passes every side chain // turned so far chooses again, in the others' new places. std::map, size_t> turned_index; // (chain, residue) -> entry in `turned` for (int pass = 0; pass < 5; pass++) { bool any = false; // made afresh after each turn: the turn moves atoms the search has indexed gemmi::NeighborSearch ns(model, cell, REACH + 1); ns.populate(/*include_h=*/false); for (size_t ci = 0; ci < model.chains.size(); ci++) for (size_t ri = 0; ri < model.chains[ci].residues.size(); ri++) { gemmi::Residue &res = model.chains[ci].residues[ri]; const std::optional sc = MakeSideChain(res); if (!sc) continue; std::vector linked; for (const auto &[a, b] : links) for (const gemmi::Atom &x : res.atoms) { if (&x == a) linked.push_back(b); if (&x == b) linked.push_back(a); } auto overlap = [&](const std::vector &p) { return OverlapOf(ns, model, cell, res, static_cast(ci), static_cast(ri), *sc, p, linked); }; const SideChainOverlap given = overlap(sc->pos); const auto earlier = turned_index.find({ci, ri}); if (given.deepest < CLASH_RELIEF_OVERLAP && earlier == turned_index.end()) continue; const std::vector chi = sc->Chis(); SideChainOverlap best = given; std::vector best_chi = chi; for (const std::vector &chis : SideChainRotamers(res.name, sc->chi.size())) { const SideChainOverlap o = overlap(sc->Build(chis)); if (o.sum < best.sum) { best = o; best_chi = chis; } } if (!(best.sum < given.sum)) continue; if (earlier == turned_index.end()) { SideChainTurn t; t.name = res.name + " " + model.chains[ci].name + res.seqid.str(); t.chi_before = chi; t.overlap_before = given.deepest; turned_index[{ci, ri}] = turned.size(); turned.push_back(t); } SideChainTurn &t = turned[turned_index[{ci, ri}]]; t.chi_after = best_chi; t.overlap_after = best.deepest; const std::vector p = sc->Build(best_chi); for (size_t i = 0; i < p.size(); i++) res.atoms[i].pos = p[i]; // its hydrogens, where it has them, went with their heavy atoms only by name: they are placed anew gemmi::remove_hydrogens(res); any = true; ns = gemmi::NeighborSearch(model, cell, REACH + 1); ns.populate(/*include_h=*/false); } if (!any) break; } return turned; }