Discovering Most Classificatory Patterns for Very Expressive Pattern Classes
Authors:
- 1 January 2003
- book chapter
- Published by Springer Nature
- p. 486-493
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Discovering Most Classificatory Patterns for Very Expressive Pattern Classes2003
- Discovering Best Variable-Length-Don’t-Care Patterns2002
- Flexible Pattern Matching in Strings2002
- A Practical Algorithm to Find the Best Episode Patterns2001
- A Practical Algorithm to Find the Best Subsequence PatternsLecture Notes in Computer Science, 2000
- Faster Approximate String MatchingAlgorithmica, 1999
- Algorithms on Strings, Trees and Sequences1997
- Approximate matching of regular expressionsBulletin of Mathematical Biology, 1989