The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees.

Sbastien Ferr

Browse the full ICFCA paper archive.