Sarah Lutteropp

(reopened because this still happens from time to time. It was not just due to some bug)

Or we can go with A, add writing to a logfile to NetRAX, and then post-evaluate whether NetRAX did encounter the correct network and just discarded it due to BIC...

Reopened because this is now the most pressing issue: If we do exhaustive {reticulationOpt, brlenOpt, modelOpt}, NetRAX becomes unbearably slow. If we don't do enough, it won't accept any moves...

There is also still this open idea to speed up brlen optimization even more: https://github.com/lutteropp/NetRAX/issues/43#issuecomment-798883538

For pre-filtering arc insertion moves, there still is the ancestral-states-idea from https://github.com/lutteropp/NetRAX/issues/41

Oh cool, so it really is just the bipartitions then. Nice, that's simple to implement! :) (I've already worked with bipartitions in trees for transfer bootstrap scores, likely can reuse...

@celinescornavacca I have implemented this:  Is this (especially the denominator) how you meant it?

Now that I think about it... Isn't our "unrooted softwired distance" the same as the normal **rooted** softwired distance definition, only that we are scaling the distance to be in...

Do we need to ignore the trivial bipartitions (with only a single taxon on one side)? Or are they counted as well?

> Now that I think about it... Isn't our "unrooted softwired distance" the same as the normal rooted softwired distance definition, only that we are scaling the distance to be...