@sdo

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

. Formal Concept Analysis, Volume 4390 von Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2007)
DOI: 10.1007/978-3-540-70901-5_7

Zusammenfassung

Strings are an important part of most real application multi-valued contexts. Their conceptual treatment requires the definition of

Beschreibung

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

Links und Ressourcen

Tags

Community

  • @sebferre
  • @dblp
  • @sdo
@sdos Tags hervorgehoben