Ferré, S.
(2007):
The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees.
In: Formal Concept Analysis.
4390. Aufl./Vol..
Hrsg./Editors: Kuznetsov, S. & Schmidt, S.
Verlag/Publisher: Springer Berlin Heidelberg,
Erscheinungsjahr/Year: 2007.
Seiten/Pages: 98-113.
[Volltext] [Kurzfassung] [BibTeX]
[Endnote]
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 }
}
%0 = incollection
%A = Ferré, Sébastien
%B = Formal Concept Analysis
%D = 2007
%I = Springer Berlin Heidelberg
%T = The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees
%U = http://dx.doi.org/10.1007/978-3-540-70901-5_7