@sdo

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

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

Аннотация

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

Описание

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

Линки и ресурсы

тэги

сообщество

  • @sebferre
  • @dblp
  • @sdo
@sdo- тэги данного пользователя выделены