<テクニカルレポート>
A Practical Algorithm to Find Best Subsequence Patterns

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 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.続きを見る

本文情報を非表示

trcs175 pdf 133 KB 36  
trcs175.ps gz 202 KB 40  

詳細

レコードID
査読有無
関連情報
タイプ
登録日 2009.04.22
更新日 2017.01.20