PUMA publications for /user/stephandoerfel/ICCShttps://puma.uni-kassel.de/user/stephandoerfel/ICCSPUMA RSS feed for /user/stephandoerfel/ICCS2024-03-29T14:17:04+01:00The Efficient Computation of Complete and Concise Substring Scales with Suffix Treeshttps://puma.uni-kassel.de/bibtex/2ba4fe6826e3895f2aab04d0f8b59c880/stephandoerfelstephandoerfel2014-11-27T17:37:12+01:00fca iccs literature substring <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Sébastien Ferré" itemprop="url" href="/author/S%c3%a9bastien%20Ferr%c3%a9"><span itemprop="name">S. Ferré</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Formal Concept Analysis</span>, </em><em>том 4390 из Lecture Notes in Computer Science, </em><em><span itemprop="publisher">Springer Berlin Heidelberg</span>, </em></span>(<em><span>2007<meta content="2007" itemprop="datePublished"/></span></em>)Thu Nov 27 17:37:12 CET 2014Formal Concept Analysis98-113Lecture Notes in Computer ScienceThe Efficient Computation of Complete and Concise Substring Scales with Suffix Trees43902007fca iccs literature substring Strings are an important part of most real application multi-valued contexts. Their conceptual treatment requires the definition of The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees - Springer