<テクニカルレポート>
A Greedy Strategy for Finding Motifs from Yes-No Examples

作成者
本文言語
出版者
発行日
雑誌名
出版タイプ
アクセス権
概要 We define a motif as an expression Z1 .Z2... Zn with sets Zl, Z2, . . . , Zn of strings in a specified family $ Omega $ called the type. This notion can capture the most of the motifs in PROSITE as we...ll as regular pattern languages. A greedy strategy is developed for finding such motifs with ambiguity just from positive and negaiive examples by exploiting the probabilistic argument. This paper concentrates on describing the idea of the greedy algorit hm with its underling theory. Its experiment a1 results on splicing sites and E. coli promoters are also presented.続きを見る

本文情報を非表示

rifis-tr-118 pdf 0.98 MB 101  

詳細

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