A weighted angle distance on strings

We define a multi-scale metric dρ on strings by aggregating angle distances between all n-gram count vectors with exponential weights ρn. We benchmark dρ in DBSCAN clustering against edit and n-gram baselines, give a linear-time suffix-tree algorithm for evaluation, prove metric and stability properties (including robustness under tandem-repeat stutters), and characterize isometries.