Releases: ms609/Rogue
v2.2.0
Performance
-
TipInstability()operates on the lower triangle of distance matrices only, halving the work for row statistics (rowMads,rowVars,rowMedians). -
New batch C function
LOG_GRAPH_GEODESIC_MULTIcomputes log-geodesic distances for all trees in a single.Call(), reusing one interim buffer and returning lower-triangle entries directly. -
Cache-friendly extraction loop in
graph_geodesic.c(stride-1 access instead of stride-all_nodes). -
Auto-enable OpenMP parallelism in Rfast operations (
rowMads,rowVars) when the distance matrix exceeds 1 000 rows. -
Use
Rfast::rowMedians()in place ofmatrixStats::rowMedians(). -
RogueTaxa()now calls.PrepareTrees()once and passes.prepared = TRUEtoQuickRogue()/Roguehalla(), avoiding redundant tree preparation. -
QuickRogue()precomputes information upper bounds for all iterations rather than recomputing each step.
v2.1.7
v2.1.6
v2.1.5
v2.1.4
v2.1.3
v2.1.2
v2.1.1
v2.1.0
-
Early termination of
QuickRogue()when no further improvement possible. -
Cophenetic()renamed to the more accurateGraphGeodesic(). -
Calculate information content of consensus trees with p > 0.5 (#15).
-
Improve support for
multiPhyloobjects. -
New vignette detailing rogue detection with Bayesian tree samples.
v2.0.0
- Information theoretic rogue detection (per Smith, 2022).