@sdo

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)
DOI: 10.1007/978-3-540-70901-5_7

Abstract

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

Description

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

Links and resources

Tags

community

  • @sebferre
  • @dblp
  • @sdo
@sdo's tags highlighted