-
The randomisations produce rank-relative scores that can be converted into significances at varying levels of alpha, but outside of Biodiverse.
It would be useful to add it as a function within Bio…
-
```
The randomisations currently track the number of times the original result was
greater than the randomised result. It also needs to keep a track of the
number times they were equal. This is im…
-
The randomisations of the trees can take a substantial chunk of time, and not necessarily be very informative. These should be opt-in.
The calculations using the labels under each branch were se…
-
The randomisations should have a rename option.
-
profiling shows some bottlenecks in Biodiverse::Randomise::rand_structured. These need to be opened up.
-
```
When a user runs a randomisation the system currently desensitises most of
the setup widgets (those that should not be changed again for this
randomisation).
It should also do any of the method s…
-
```
The randomisations currently do nothing to the group properties, and simply
re-assign them to the randomised basedata.
An option needs to be added to control this behaviour.
The same goes f…
-
Possible solution to the bottleneck flagged in #685 is at https://stackoverflow.com/a/5684892
This would avoid the need for binary searches across sorted lists, providing the insertion and deletion…
-
Benchmarking shows that the List::MoreUtils binary search functions are faster than the current implementation using List::BinarySearch, probably due to subroutine overheads. The LMU code is entirely…
-
The "checkpoint save iterations" option in the randomisations is from back when the memory leaks in issue #5 were causing grief.
This should be off by default, for which the simplest approach is to…