Figure 11.
Greedy algorithm, XlinkPlan, given a set S of models, a set of possible experiments, desired discriminability ɛ , ambiguity region A, and maximum number of experiments Nmax and coverage Cmax′. The output is a subset ɛ′of experiments covering a subset P′ of model-pairs. For residue-specific cross-linking plans, a model-pair must be covered by a single experiment at the given Δ level. For disulfide trapping plans, the weight w on a model-pair keeps track of the remaining coverage to complete Δ, to be provided by subsequent experiments.