On the complexity of finding emerging patterns

DOI10.1016/J.TCS.2004.12.014MaRDI QIDQ1781987zbMATH OpenOpenAlexFDO

Authors Lusheng Wang, Guozhu Dong, Jianping Li, 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

zbMATH Keywords

Inapproximability

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20)

Recommendations

• scientific article; zbMATH DE number 1934542
• Finding similar regions in many sequences
• Computing and Combinatorics
• scientific article; zbMATH DE number 1696426
• Algorithmic and complexity issues of three clustering methods in microarray data analysis

Cites work

• scientific article; zbMATH DE number 1256636 (Why is no real title available?)
• Optimization, approximation, and complexity classes

Cited in

(5)

• Bad News on Decision Problems for Patterns
• scientific article; zbMATH DE number 2145066 (Why is no real title available?)
• A novel approach of mining strong jumping emerging patterns based on BSC-tree
• AI 2003: Advances in Artificial Intelligence
• Multilevel descriptions of classes decreasing the number of steps in solving pattern recognition problems described by propositional formulas

This page was built for publication: On the complexity of finding emerging patterns

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1781987)