A wavelet forest for a text T [1..n] over an alphabet σ takes n H_0
(T) ...
It is not difficult to think of applications that can be modelled as gra...
The maximum parsimony distance d_MP(T_1,T_2) and the
bounded-state maxim...
Short text clustering is a challenging task due to the lack of signal
co...
We present the first fixed-parameter algorithm for constructing a tree-c...