### Abstract

Finding a pattern which separates two sets is a critical task in discovery. Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. Episode pattern is a generalized concept of subsequence pattern where the length of substring containing the subsequence is bounded. We generalize these problems to optimization problems, and give practical algorithms to solve them exactly. Our algorithms utilize some pruning heuristics based on the combinatorial properties of strings, and efficient data structures which recognize subsequence and episode patterns.

Original language | English |
---|---|

Title of host publication | Progress in Discovery Science |

Publisher | Springer Verlag |

Pages | 307-317 |

Number of pages | 11 |

ISBN (Print) | 3540433384, 9783540433385 |

DOIs | |

Publication status | Published - Jan 1 2002 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 2281 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Finding best patterns practically'. Together they form a unique fingerprint.

## Cite this

*Progress in Discovery Science*(pp. 307-317). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2281). Springer Verlag. https://doi.org/10.1007/3-540-45884-0_21