Ferré, S.: The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees. In: Kuznetsov, S. & Schmidt, S. (Hrsg.): Formal Concept Analysis. Springer Berlin Heidelberg, 2007 (Lecture Notes in Computer Science 4390), S. 98-113
[Volltext]
Strings are an important part of most real application multi-valued contexts. Their conceptual treatment requires the definition of
@incollection{ferre2007efficient,
author = {Ferré, Sébastien},
title = {The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees},
editor = {Kuznetsov, SergeiO. and Schmidt, Stefan},
booktitle = {Formal Concept Analysis},
series = {Lecture Notes in Computer Science},
publisher = {Springer Berlin Heidelberg},
year = {2007},
volume = {4390},
pages = {98-113},
url = {http://dx.doi.org/10.1007/978-3-540-70901-5_7},
doi = {10.1007/978-3-540-70901-5_7},
isbn = {978-3-540-70828-5},
keywords = {fca, iccs, literature, substring},
abstract = {Strings are an important part of most real application multi-valued contexts. Their conceptual treatment requires the definition of }
}