The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees.
In:
S. Kuznetsov and S. Schmidt, editors,
Formal Concept Analysis, pages 98-113.
Springer Berlin Heidelberg, 2007.
Sébastien Ferré.
[doi]
[abstract]
[BibTeX]
Strings are an important part of most real application multi-valued contexts. Their conceptual treatment requires the definition of