in our current algorithm, we do not consider swapping labels where there is already a perfect match even if such swaps are permissible by our definition.
one reviewer pointed out that it might be worth it to include as it would give some sense of the possible variance in the data (same reason we recommend conducting comparative analyses across multiple permutations). i think this might be worth considering. think this could be done by adding a second pass through the tree but haven't fleshed this out fully. any ideas?
in our current algorithm, we do not consider swapping labels where there is already a perfect match even if such swaps are permissible by our definition.
one reviewer pointed out that it might be worth it to include as it would give some sense of the possible variance in the data (same reason we recommend conducting comparative analyses across multiple permutations). i think this might be worth considering. think this could be done by adding a second pass through the tree but haven't fleshed this out fully. any ideas?