The Efficient Computation of Complete and Concise Substring Scales with Suffix Trees
From MaRDI portal
Publication:3590985
DOI10.1007/978-3-540-70901-5_7zbMath1187.68721MaRDI QIDQ3590985
Publication date: 3 September 2007
Published in: Formal Concept Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-70901-5_7
Related Items
\textsc{RCA-seq}: an original approach for enhancing the analysis of sequential data based on hierarchies of multilevel closed partially-ordered patterns, On mining complex sequential data by means of FCA and pattern structures