Algorithm.

Expand-Candidate-Terms (𝒯, 𝒜, α, β, ℳ[ ][ ]).

1:	Initialize seed list S = 𝒯
2:	Set context terms 𝒞 = 𝒯 ∪ 𝒜
3:	S.append( Apply-Context(𝒜, β, 𝒞, ℳ[][]))
	{Next, we iterate over terms in list S}
4:	for all terms t in S do
5:	Let H = [] be an empty list
6:	for each i such that ℳ[t][i] > α do
7:	H.append(i-th MeSH term)
8:	relevantTerms = Apply-Context (H, β, 𝒞, ℳ[][])
9:	relavantTerms = relevantTerms - S {avoid adding existing terms}
10:	S.append(relevantTerms)
11:	return S