Traditionally, rust fungi are understood to disperse primarily through wind or water, relying on the production of vast quantities of small, lightweight urediniospores adapted for aerial transport. However, recent field observations have challenged this singular view of abiotic dispersal. Researchers have documented Western honey bees, Apis mellifera, actively collecting urediniospores of A. psidii from infected host plants. These foragers store the spores in their pollen baskets and return them to the hive in a manner that is visually and behaviorally indistinguishable from standard pollen foraging. This behavior suggests a potential novel mutualistic interaction between two alien species, where the fungus gains a new mode of dispersal and the bee may obtain an alternative source of nutrition.

To validate this hypothesis, researchers investigated two critical conditions required for such a mutualism to function: whether the spores remain viable after entering the hive environment and whether they provide a nutritional benefit to the pollinator. The study focused on the persistence of A. psidii urediniospores within honey bee colonies and their nutritional composition. By testing these factors, the team aimed to determine if spore foraging is a viable strategy for honey bees rather than an aberration, and if this interaction could facilitate the long-distance dispersal of the pathogen.

The results indicated that A. psidii spores remain viable for at least nine days within honey bee colonies. In controlled trials, spores placed in hives maintained germination rates comparable to initial levels, showing no significant decline in viability over the nine-day period. This persistence is particularly concerning given that commercial hives are frequently transported over long distances for agricultural pollination services, typically within a three-to-seven-day window. The survival of viable spores during this timeframe suggests that managed hives could act as a significant vector for the pathogen, a pathway not currently incorporated into existing biosecurity frameworks.

Nutritional analysis revealed that A. psidii urediniospores match or exceed the nutritional quality of known high-protein pollens. The spores contained 22.5% protein, which is comparable to willow pollen and significantly higher than other fungal spores tested. Furthermore, the spores contained all ten essential amino acids required for honey bee development in amounts above the minimum thresholds for full protein absorption. These findings suggest that the spores are not merely contaminants but a potentially valuable dietary resource for the bees, especially in environments where floral resources are scarce due to drought, habitat loss, or the rust infection itself.

Artificial rearing trials further demonstrated that A. psidii spores support normal development and survival in honey bee brood. Larvae fed diets containing the rust spores developed at rates and achieved weights similar to those fed high-quality pollen sources. While survival rates were slightly lower than those on kiwifruit pollen, they remained well above the minimum thresholds for colony health. In contrast, larvae fed spores from a different rust species, Melampsora sp., showed reduced survival and lower body weight, indicating that not all fungal spores are equal in their nutritional value to bees. The specific amino acid balance in A. psidii spores appears to be key to their suitability as a food source.

This interaction exemplifies an “invasional mutualism,” a phenomenon where introduced species facilitate each other’s success, often exacerbating the speed and scale of invasion. In this case, the rust gains a new mode of urediniospore dispersal, while the bee obtains an alternative source of protein. This dynamic could create a positive ecological feedback loop: as myrtle rust reduces floral resources, bees may increasingly turn to fungal spores for nutrition, thereby enhancing the pathogen’s spread and further depleting the floral resources that support pollinator networks. Such a cycle could destabilize plant-pollinator interactions and forest regeneration, particularly in regions with high Myrtaceae endemism.

The implications for biosecurity are significant. Current national and regional strategies, such as the Australian Myrtle Rust Action Plan and New Zealand surveillance plans, do not yet include the potential of apiculture in the spread of plant pathogens. Recognizing pollinators as potential vectors is essential for developing more effective containment strategies. Integrating pollinator movement into management plans could help limit the geographic expansion of A. psidii and protect biodiversity in vulnerable areas. Future research should experimentally test the final condition for mutualism: successful infection of a new host following pollinator-mediated dispersal. Quantifying the relative contribution of insect-mediated versus windborne dispersal across different landscapes and seasons will be vital for forecasting future spread and designing evidence-based interventions.

Subject of Research: Honey bees as potential vectors of the invasive rust pathogen Austropuccinia psidii: nutritional mutualism and implications for pathogen spread

Article Title: Honey bees as potential vectors of the invasive rust pathogen Austropuccinia psidii : nutritional mutualism and implications for pathogen spread

Article References: Shin-Clayton, S., Mortensen, A. N., Beggs, J. R., Buxton, M. N., Hauxwell, C., Bateson, M. F., Jochym, M., Pegg, G. S., & Pattemore, D. E. (2026). Honey bees as potential vectors of the invasive rust pathogen Austropuccinia psidii: nutritional mutualism and implications for pathogen spread. NeoBiota, 106, 75-90. https://doi.org/10.3897/neobiota.106.169027

Image Credits: AI Generated

DOI: 10.3897/neobiota.106.169027

Keywords: Honey, bees, potential, vectors, invasive, rust, pathogen, Austropuccinia, psidii, nutritional, mutualism, implications

The core idea is deceptively simple: treat a hand-drawn signature as a biometric trait, just as banks and document workflows have done for decades with pen and paper. What makes AirSign distinctive is how it captures that signature. Instead of confining users to a predefined two-dimensional plane, or demanding specialized peripherals such as data gloves or a Leap Motion sensor mounted on a desk, the system exploits hardware that modern headsets already carry. Users can sign either with motion controllers or, on devices that support it, with camera-based hand tracking. A single unified gesture, a pinch between the index finger and thumb, signals the intent to write. When the virtual fingertips touch, the system begins sampling the three-dimensional coordinates of the fingertip at the headset’s refresh rate, typically 90 to 120 hertz, and renders the resulting strokes in real time so the user receives immediate visual feedback.

Under the hood, every signature becomes a multivariate time series. Each sampled point stores a position vector and a velocity vector, the latter computed from the change in position between consecutive frames divided by the elapsed time. Because the hand-tracking cameras on consumer headsets rely on monocular RGB input without dedicated depth sensors, the raw trajectory is noisy. To tame the jitter, the researchers apply linear interpolation, smoothing each sampled position halfway toward the previous one. This acts as a first-order low-pass filter, balancing responsiveness against stability. Two normalization steps then make signatures comparable regardless of where and how the user was facing when signing: the entire trajectory is translated so its first point sits at the world origin, and it is rotated by a quaternion so that the user’s initial viewing direction aligns with a canonical axis. The result is a signature that can be drawn anywhere, at any orientation, and still be matched against stored templates.

Comparing two signatures captured at different speeds and lengths is the central algorithmic challenge, and it is where Dynamic Time Warping enters the picture. Simple Euclidean distance fails catastrophically when two otherwise identical trajectories are temporally shifted, because points that should correspond are compared with the wrong partners. DTW solves this by warping the time axis of one sequence to find an optimal non-linear alignment with the other, minimizing the cumulative local distance along an admissible warping path that respects boundary, continuity, and monotonicity constraints. The method’s key property for signature verification is its invariance to time shifts: identical but misaligned sequences yield a distance at or near zero. Classic DTW carries a quadratic cost in both time and memory, however, which is prohibitive on a battery-powered headset, so the team turned to FastDTW, a multilevel approximation that coarsens the series, projects a low-resolution warping path upward, and refines it within a constrained radius, achieving linear time and space complexity.

The engineering choices reveal how much practical constraint shapes such systems. An early client-server design was abandoned in favor of fully on-device processing, with signature data saved directly to the headset’s local file system. The DTW computation was rewritten in Rust after benchmarks showed the original Python implementation took 2.37 seconds to compare a 383-point signature with itself, while the Rust version finished in 0.03 seconds, roughly 79 times faster. On a tenfold larger sample of 3,830 points, the gap widened to 480-fold, with Rust completing in 0.13 seconds what Python needed more than a minute to do. Further optimizations, including a Sakoe-Chiba band that restricts the warping path to a diagonal window and a diagonal DTW variant that slashes memory use, cut processing time by more than half on a 70,000-point signature. Classification also runs asynchronously on a background thread, preventing the rendering loop from freezing, a detail that matters enormously in VR, where a stalled frame that no longer matches head movement can induce motion sickness.

Even the choice of which features to feed the matcher mattered. An initial feature set combining position, velocity, and acceleration produced puzzling misclassifications: a handwritten name and an arbitrary wave pattern were judged suspiciously similar to a figure eight, with average DTW distances low enough to slip beneath the acceptance threshold. Ablation analysis showed that acceleration data was injecting noise rather than discriminative power, so the team stripped it out, keeping only position and velocity. The revised feature set produced a much clearer separation between similar and dissimilar signatures, eliminated the false positives, and, as a bonus, shrank the data files and simplified the computation. It is a textbook example of how more sensors and more features do not automatically mean better biometrics.

To evaluate the system, the researchers recruited 28 volunteers, roughly 60 percent male and 40 percent female, aged between 20 and 40, none of whom had meaningful prior headset experience. Each participant produced 25 signatures under two input modalities, controllers and hand tracking, and two experimental conditions. In the fixed-signature scenario, everyone wrote the same word, AIRSIGNX, deliberately stressing the system’s ability to distinguish people who share an identical signature shape. In the custom-signature scenario, each user chose a personal symbol or name, mimicking real-world variability. The team measured false acceptance and false rejection rates across swept thresholds and derived Equal Error Rates, the operating point where the two error rates coincide. Custom signatures proved markedly easier to verify, with EERs as low as 0.030 to 0.061 depending on input method, corresponding to authentication accuracy of roughly 94 to 97 percent. The hostile fixed-signature scenario, which doubles as a simulation of a skilled forgery attack in which an attacker knows the target’s signature shape, yielded EERs between 0.097 and 0.165, still translating to accuracy between roughly 83.5 and 90 percent.

Two further findings stand out. First, when the template gallery was reduced from 20 signatures per user to just 5, error rates rose only marginally, with the custom-signature EER reaching 0.030 with controllers and 0.053 with hand tracking. That stability matters for practical deployment, because it suggests users could enroll quickly without degrading security. Second, controllers consistently outperformed hand tracking on the Area Under the Curve metric, with very large effect sizes in both scenarios, reflecting the spatial jitter, gesture-detection latency, and occasional tracking losses inherent to camera-based hand modeling. Yet for the metric that matters most in practice, the EER on custom signatures, the difference between input methods was statistically negligible. In other words, when inter-class variability is high, the noisier but more convenient hand-tracking mode authenticates just as reliably, especially after smoothing. Users themselves praised the pinch-to-write gesture as natural and ergonomic, with the only recurring complaint being a slight lag in detecting fingertip contact at the start and end of strokes.

The security analysis is framed with appropriate caution. The researchers consider three threat levels: zero-knowledge attacks by random impostors, captured by the custom-signature EER; shape-aware attacks by forgers who know what the victim writes, captured by the fixed-signature EER; and dynamics-aware attacks, which they defer to dedicated future adversarial testing. Including velocity profiles in the DTW calculation is hypothesized to resist spatial replay attacks, since replicating how fast a signature was drawn is substantially harder than copying its shape, but the team is explicit that this hypothesis still needs rigorous testing. On the performance side, the entire verification cycle, including normalization, feature extraction, and DTW matching, completes within 350 milliseconds and adds less than 2 percent power draw on a standalone Meta Quest 2, confirming that biometric authentication can run continuously without draining the battery or degrading frame rates.

The authors are candid about the study’s limits. Twenty-eight participants cannot represent the full demographic spectrum, all data was collected in a single session, and no head-to-head comparison with classifiers such as support vector machines or deep learning architectures was possible, partly because variable-length 3D time series resist fixed-length feature extraction and the sample size is too small to train neural models fairly. They position AirSign accordingly, not as a novel classification algorithm but as a systems-level contribution: the first demonstration that unconstrained, on-device, three-dimensional signature verification is feasible on ordinary consumer VR hardware. Future work will scale the user cohort, parallelize the DTW computation across CPU cores, refine index-thumb contact detection, mount a proper defense against forged signatures, and benchmark the approach against gaze, motion, and keystroke biometrics. If those steps succeed, the awkward floating keyboard may finally give way to something far more intuitive: simply signing your name into the air.

Subject of Research: VR-based 3D hand-written signature recognition for biometric user authentication in virtual reality

Article Title: AirSign: An innovative VR-based hand-written signature recognition

Article References: Frascarelli, G., Marini, M. R., De Marsico, M., Mecca, A., & Cinque, L. (2026). AirSign: An innovative VR-based hand-written signature recognition. Multimedia Tools and Applications, 85(10), Article 790. https://doi.org/10.1007/s11042-026-21951-x

Image Credits: AI Generated

DOI: 10.1007/s11042-026-21951-x

Keywords: virtual reality, biometrics, signature recognition, Dynamic Time Warping, hand tracking, authentication, Meta Quest, behavioral biometrics, Rust, Unity, human-computer interaction, cybersecurity

The problem rsx tackles is deceptively simple to state but computationally brutal in practice. RAD-seq allows researchers to sample thousands of genomic positions scattered across the chromosomes of organisms whose genomes have never been sequenced in full, from fish and frogs to plants and fungi. By comparing how often each of these DNA fragments appears in males versus females, scientists can flag markers that show up almost exclusively in one sex, which are candidates for the sex-determining region. The standard analysis, implemented in the RADSex tool, builds an enormous table recording the sequencing depth of every marker in every individual, then tests each row for a statistically significant sex bias. As sequencing panels grow into the millions of distinct RAD tags, that table balloons, and the original C++ implementation becomes memory-hungry to the point of failure on ordinary workstations.

rsx attacks the memory bottleneck with a set of techniques drawn from modern systems programming and database engineering. DNA sequences are compressed into 2-bit packed keys, storing four nucleotides per byte with a one-byte header that preserves the exact sequence length. After the initial parallel reading of FASTQ files, every downstream command operates either on a memory-mapped marker table or on externally sorted, lz4-compressed chunks on disk, which means the tool never copies the whole dataset into RAM. The writable memory footprint is instead bounded by the number of individuals in the study, or by an explicit user-chosen buffer, and is completely independent of how many millions of markers the panel contains. This allows researchers to analyse tables with vast numbers of rare tags without discarding candidates, a down-sampling sacrifice the memory-hungry original sometimes forced.

Speed comes from a combination of parallelism and clever data structures. Group membership is encoded in bitsets built once from the population map, with one 64-bit machine word covering 64 individuals; intersecting a marker’s presence pattern with the male and female masks then costs 64 times fewer operations than scanning individuals one by one. Producer-consumer pipelines built on crossbeam channels stream parsed records from a parser thread to per-marker consumers, and external sorting with k-way merges handles order statistics and table merging without loading everything at once. Even the median depth, a routine quality-control statistic, is computed exactly from only the nonzero entries of each depth vector, exploiting the fact that a given RAD tag is absent in most individuals, which shrinks the sorting workload dramatically.

The most scientifically consequential addition, however, is statistical rather than computational. RADSex reported only frequentist significance calls, offering no measure of how strongly the evidence actually supports sex linkage. rsx augments every marker with conjugate Beta-Binomial Bayes factors and directional posterior probabilities, computed in closed form through log-gamma functions and log-sum-exp evaluation, so no sampling or numerical quadrature is needed. Each marker is then graded into one of three explicit tiers: a strict call meeting the conventional significance threshold, a hypothesis supported by posterior evidence, or a row supported only by its Bayes factor. A configurable prior probability that any given tag is sex-linked, along with adjustable Beta prior shapes on the group prevalence rates, lets researchers tailor the evidence model to their organism. Every output row also records the exact uncorrected p-value, the Bayes factor and the posterior, together with machine-readable provenance headers documenting the parameters used.

For dimensionality reduction, rsx streams a Gram matrix accumulation rather than ever materialising the full marker-by-individual matrix. By the fundamental theorem of the singular value decomposition, the eigenvectors of the n-individual by n-individual Gram matrix are exactly the principal component loadings that a full-matrix SVD would produce, so the result is identical up to sign and numerical tolerance while memory drops from scaling with both markers and individuals to scaling only with the square of the individual count. This identity, long used for out-of-core PCA on genotype matrices, is here derived and verified with SymPy scripts and a Lean model of the median selection rule, all shipped with the code. The authors also performed a forward-error analysis of the Yates-corrected chi-squared path, showing that 64-bit integer cross-products before floating-point conversion keep reported p-values accurate to a few units in the last place, and that p-values are clamped at ten to the minus sixteen to match the original reference and avoid spurious claims of exact zeros.

Validation was rigorous and, unusually for method papers, close to exhaustive. Across four published RAD-seq panels, rsx reproduced every call made by RADSex v1.2.0, recovering all Bonferroni-significant positive-control markers, and matched the original’s six-significant-digit output formatting exactly, including a small correction step for the decimal exponent that prevents off-by-one errors on powers of ten. Precision test suites check that the p-value evaluators track the complementary error function to one part in ten to the fifteenth and never leave the valid probability interval. The optional CUDA backend batches the per-marker arithmetic on the GPU, adding up to 29.86-fold acceleration on the p-value computation batch, while Python and C bindings expose the same core to notebooks and workflow engines, closing a long-standing gap since the original offered no programmatic interface.

The authors were careful to scope their comparisons honestly. Alternative tools such as SEX-DETector, which relies on RNA-seq segregation in controlled crosses, and findZX, which uses whole-genome coverage profiles, consume fundamentally different input data and cannot be benchmarked head-to-head on identical RAD-seq panels without manufacturing measurements that were never made. The team did execute both competitors on their authors’ own example datasets, confirming installation and end-to-end operation, but stopped short of claiming relative biological accuracy. What rsx offers instead is a drop-in replacement: the complete RADSex command set is preserved, command-line compatibility is maintained, and marker-table semantics are unchanged, so existing pipelines can adopt the new engine without modification while gaining the Bayesian evidence grades as a bonus.

Released under the GPL-3.0-or-later licence with a reproducibility archive covering every reported number, rsx arrives at a moment of surging interest in sex chromosome evolution across ecology and evolutionary biology. Researchers studying species with environmental or polygenic sex determination, or tracking the early stages of sex chromosome differentiation in recently diverged lineages, now have a tool that scales to contemporary sequencing volumes on laptops rather than clusters, and that reports not just a binary verdict but a graded, transparent accounting of the evidence for every marker. For a field long constrained by the computational ceiling of its standard workflow, the arrival of an allocation-bounded, statistically richer and GPU-accelerated successor marks a genuine widening of what non-model genomics can attempt.

Subject of Research: A high-performance Rust software toolkit for identifying sex-linked markers from RAD-seq data in non-model organisms

Article Title: rsx: a high-performance streaming toolkit for RAD-seq sex determination

Article References: Goswami, R., & Goswami, R. (2026). rsx: a high-performance streaming toolkit for RAD-seq sex determination. BMC Bioinformatics. https://doi.org/10.1186/s12859-026-06628-4

Image Credits: AI Generated

DOI: 10.1186/s12859-026-06628-4

Keywords: RAD-seq, sex determination, Rust, bioinformatics, streaming algorithms, Bayesian statistics, GPU computing, non-model organisms, sex-linked markers, BMC Bioinformatics, genomics, high-performance