On the complexity of finding emerging patterns
From MaRDI portal
Publication:1781987
DOI10.1016/j.tcs.2004.12.014zbMath1080.68042OpenAlexW2111282295MaRDI QIDQ1781987
Jianping Li, Guozhu Dong, Lusheng Wang, Hao. Zhao
Publication date: 10 June 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.12.014
Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Multilevel descriptions of classes decreasing the number of steps in solving pattern recognition problems described by propositional formulas ⋮ A novel approach of mining strong jumping emerging patterns based on BSC-tree
Cites Work
This page was built for publication: On the complexity of finding emerging patterns
