The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees
S. Ferré.
Formal Concept Analysis, volume 4390 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2007)

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

URL

http://dx.doi.org/10.1007/978-3-540-70901-5_7

search on

This publication has not been reviewed yet.

rating distribution

average user rating0.0 out of 5.0 based on 0 reviews

Please log in to take part in the discussion (add own reviews or comments).

@incollection{ferre2007efficient,
  abstract = {Strings are an important part of most real application multi-valued contexts. Their conceptual treatment requires the definition of },
  added-at = {2014-11-27T17:37:12.000+0100},
  author = {Ferré, Sébastien},
  biburl = {https://puma.uni-kassel.de/bibtex/2ba4fe6826e3895f2aab04d0f8b59c880/stephandoerfel},
  booktitle = {Formal Concept Analysis},
  description = {The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees - Springer},
  doi = {10.1007/978-3-540-70901-5_7},
  editor = {Kuznetsov, SergeiO. and Schmidt, Stefan},
  interhash = {133009b4ec80fb0de399a0ce54142599},
  intrahash = {ba4fe6826e3895f2aab04d0f8b59c880},
  isbn = {978-3-540-70828-5},
  keywords = {fca iccs literature substring},
  language = {English},
  pages = {98-113},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  timestamp = {2014-11-27T17:37:12.000+0100},
  title = {The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees},
  url = {http://dx.doi.org/10.1007/978-3-540-70901-5_7},
  volume = 4390,
  year = 2007
}

%0 Book Section
%1 ferre2007efficient
%A Ferré, Sébastien
%B Formal Concept Analysis
%D 2007
%E Kuznetsov, SergeiO.
%E Schmidt, Stefan
%I Springer Berlin Heidelberg
%K fca iccs literature substring
%P 98-113
%R 10.1007/978-3-540-70901-5_7
%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
%V 4390
%X Strings are an important part of most real application multi-valued contexts. Their conceptual treatment requires the definition of
%@ 978-3-540-70828-5

PUMA

The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees
S. Ferré.
Formal Concept Analysis, volume 4390 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2007)

Tags

Users

Comments and Reviews

Cite this publication

PUMA

The Efficient Computation of Complete and Concise Substring Scales with Suffix TreesS. Ferré. Formal Concept Analysis, volume 4390 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2007)

Tags

Users

Comments and Reviews

Cite this publication

The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees
S. Ferré.
Formal Concept Analysis, volume 4390 of Lecture Notes in Computer Science, Springer Berlin Heidelberg, (2007)