### Abstract

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. We generalize the problem to an optimization problem, and give a practical algorithm to solve it exactly. Our algorithm uses pruning heuristic and subsequence automata, and can find the best subsequence. We show some experiments, that convinced us the approach is quite promising.

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

Title of host publication | Discovery Science - 3rd International Conference, DS 2000, Proceedings |

Editors | Setsuo Arikawa, Shinichi Morishita |

Publisher | Springer-Verlag |

Pages | 141-153 |

Number of pages | 13 |

ISBN (Print) | 9783540413523 |

Publication status | Published - 2000 Jan 1 |

Externally published | Yes |

Event | 3rd International Conference on Discovery Science, DS 2000 - Kyoto, Japan Duration: 2000 Dec 4 → 2000 Dec 6 |

### Publication series

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

Volume | 1967 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 3rd International Conference on Discovery Science, DS 2000 |
---|---|

Country | Japan |

City | Kyoto |

Period | 00/12/4 → 00/12/6 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'A practical algorithm to find the best subsequence patterns'. Together they form a unique fingerprint.

## Cite this

Hirao, M., Hoshino, H., Shinohara, A., Takeda, M., & Arikawa, S. (2000). A practical algorithm to find the best subsequence patterns. In S. Arikawa, & S. Morishita (Eds.),

*Discovery Science - 3rd International Conference, DS 2000, Proceedings*(pp. 141-153). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1967). Springer-Verlag.