%0 
%0 Book Section
%A Ferré, Sébastien
%D 2007
%T The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees
%E Kuznetsov, SergeiO. & Schmidt, Stefan
%B Formal Concept Analysis
%C 
%I Springer Berlin Heidelberg
%V 4390
%6
%N 
%P 98-113
%& 
%Y 
%S Lecture Notes in Computer Science
%7 
%8 
%9 
%? 
%! 
%Z 
%@ 978-3-540-70828-5
%(
%)
%*
%L
%M
%1 
%2 The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees - Springer
%3 incollection
%4 
%# 
%$ 
%F ferre2007efficient
%K fca, iccs, literature, substring
%X Strings are an important part of most real application multi-valued contexts. Their conceptual treatment requires the definition of 
%Z 
%U http://dx.doi.org/10.1007/978-3-540-70901-5_7
%+
%^