TY  - CHAP
AU  - Ferré, Sébastien
A2  - Kuznetsov, SergeiO.
A2  - Schmidt, Stefan
T1  - The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees
T2  - Formal Concept Analysis
PB  - Springer Berlin Heidelberg
C1  - 
PY  - 2007/
VL  - 4390
IS  - 
SP  - 98
EP  - 113
UR  - http://dx.doi.org/10.1007/978-3-540-70901-5_7
DO  - 10.1007/978-3-540-70901-5_7
KW  - fca
KW  - iccs
KW  - literature
KW  - substring
L1  - 
SN  - 978-3-540-70828-5
N1  - The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees - Springer
N1  - 
AB  - Strings are an important part of most real application multi-valued contexts. Their conceptual treatment requires the definition of 
ER  -