A practical algorithm to find the best subsequence patterns

@article{Hirao2003APA,
  title={A practical algorithm to find the best subsequence patterns},
  author={Masahiro Hirao and Hiromasa Hoshino and Ayumi Shinohara and Masayuki Takeda and Setsuo Arikawa},
  journal={Theor. Comput. Sci.},
  year={2003},
  volume={292},
  pages={465-479}
}
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 preliminary experiments, that convinced us that the approach is quite promising. 
22 Citations
23 References
Similar Papers

Similar Papers

Loading similar papers…