Currently the greedy algorithm tries to cover seed windows. In some cases, this is not ideal, as it can result in clusters that are very similar (e.g. they have partial alignment to another cluster). One solution is to change the greedy algorithm so it tries to cover seed residues (instead of windows).
Currently the greedy algorithm tries to cover seed windows. In some cases, this is not ideal, as it can result in clusters that are very similar (e.g. they have partial alignment to another cluster). One solution is to change the greedy algorithm so it tries to cover seed residues (instead of windows).