Algorithms for String Pattern Discovery

Authors:
Hideo Bannai
Affiliations:
Department of Informatics, Kyushu University, 774 Moto-oka, Nishiku, Fukuoka 819---0395, Japan
Venue:
MDAI '07 Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence
Year:
2007

Citing 9
Cited 0

On the complexity of learning strings and sequences

Theoretical Computer Science
Discovering Best Variable-Length-Don't-Care Patterns

DS '02 Proceedings of the 5th International Conference on Discovery Science
Finding Best Patterns Practically

Progress in Discovery Science, Final Report of the Japanese Discovery Science Project
Color Set Size Problem with Application to String Matching

CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
A Practical Algorithm to Find the Best Episode Patterns

DS '01 Proceedings of the 4th International Conference on Discovery Science
A practical algorithm to find the best subsequence patterns

Theoretical Computer Science
An O(N^2) Algorithm for Discovering Optimal Boolean Pattern Pairs

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Linear pattern matching algorithms

SWAT '73 Proceedings of the 14th Annual Symposium on Switching and Automata Theory (swat 1973)
Practical algorithms for pattern based linear regression

DS'05 Proceedings of the 8th international conference on Discovery Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Pattern discovery from string data is an important problem with many applications. In this paper, we give a brief overview of our work on the optimal correlated pattern discovery problem, which integrates numerical attribute information into the string pattern discovery process.