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

Sébastien Ferré. The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees. In Sergei O. Kuznetsov, Stefan Schmidt, editors, Formal Concept Analysis, 5th International Conference, ICFCA 2007, Clermont-Ferrand, France, February 12-16, 2007, Proceedings. Volume 4390 of Lecture Notes in Computer Science, pages 98-113, Springer, 2007. [doi]

Abstract

Abstract is missing.