Ferré, S.: The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees. In: Kuznetsov, S. & Schmidt, S. (Hrsg.):
Formal Concept Analysis. Springer Berlin Heidelberg, 2007 (Lecture Notes in Computer Science 4390), S. 98-113
[Volltext] [Kurzfassung]
[BibTeX]
Strings are an important part of most real application multi-valued contexts. Their conceptual treatment requires the definition of