A practical algorithm to find the best subsequence patterns

Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara, Masayuki Takeda, Setsuo Arikawa

Research output: Contribution to journalArticle

11 Citations (Scopus)

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. We regard it to find a subsequence pattern which separates these two sets. The problem is known to be NP-complete. We naturally generalize it to an optimization problem, where we try to find a subsequence pattern which maximally separates these two sets. We provide a practical algorithm to solve it exactly. Our algorithm uses two pruning heuristics based on the properties of subsequence languages, and utilizes the data structure called subsequence automata. We report some experimental results, which show these heuristics and the data structure contribute to reduce the search time.

Original languageEnglish
Pages (from-to)465-479
Number of pages15
JournalTheoretical Computer Science
Volume292
Issue number2
DOIs
Publication statusPublished - Jan 27 2003

All Science Journal Classification (ASJC) codes

  • 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