A Practical Algorithm to Find the Best Subsequence Patterns
- 1 January 2000
- conference paper
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- Vol. 292 (2), 141-154
- https://doi.org/10.1007/3-540-44418-1_12
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Mining sequential patternsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Online construction of subsequence automata for multiple textsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- SPLASH: structural pattern localization analysis by sequential histogramsBioinformatics, 2000
- Discovering Unordered and Ordered Phrase Association Patterns for Text MiningLecture Notes in Computer Science, 2000
- A Fast Algorithm for Discovering Optimal String Patterns in Large Text DatabasesLecture Notes in Computer Science, 1998
- Episode matchingLecture Notes in Computer Science, 1997
- Three ? P 2 -complete problems in computational learning theorycomputational complexity, 1991
- Searching subsequencesTheoretical Computer Science, 1991
- On the Complexity of Learning Strings and SequencesPublished by Elsevier BV ,1991
- Finding patterns common to a set of stringsJournal of Computer and System Sciences, 1980