Extended Data Fig. 1: Greedy extension for QSMap/QSMapR.
From: A fully automated benchmarking suite to compare macromolecular complexes
Both algorithms extend an initial chain mapping between a model and a reference (abbreviated as mdl/ref) using a greedy strategy. Extension for QSMapR produces complete mappings, while the one for QSMap may stop early for disconnected structures, though the full QSMap algorithm still enforces a complete mapping. For hetero-oligomers, chain pairs that are considered for mapping extension (orange in workflow), must belong to the same group as defined by the algorithm described in “Sequence-based grouping of polymer chains in QSMap/QSMapR”.
