The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees
Formal Concept Analysis, volume 4390 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2007)

Strings are an important part of most real application multi-valued contexts. Their conceptual treatment requires the definition of
  • @stephandoerfel
This publication has not been reviewed yet.

rating distribution
average user rating0.0 out of 5.0 based on 0 reviews
    Please log in to take part in the discussion (add own reviews or comments).