WEKO3
アイテム
Stochastic Regular Approximation of Tree Grammars and Its Application to Faster ncRNA Family Annotation
https://ipsj.ixsq.nii.ac.jp/records/18600
https://ipsj.ixsq.nii.ac.jp/records/186005934238f-16fb-49c6-845b-dd5769537c92
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-TBIO4817004.pdf (349.4 kB)
|
Copyright (c) 2007 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Trans(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2007-11-15 | |||||||
| タイトル | ||||||||
| タイトル | Stochastic Regular Approximation of Tree Grammars and Its Application to Faster ncRNA Family Annotation | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Stochastic Regular Approximation of Tree Grammars and Its Application to Faster ncRNA Family Annotation | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | Original Papers | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| 著者所属 | ||||||||
| Department of Computer Science the University of Electro-Communications | ||||||||
| 著者所属 | ||||||||
| Department of Computer Science the University of Electro-Communications | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science, the University of Electro-Communications | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computer Science, the University of Electro-Communications | ||||||||
| 著者名 |
Kazuya, Ogasawara
× Kazuya, Ogasawara
|
|||||||
| 著者名(英) |
Kazuya, Ogasawara
× Kazuya, Ogasawara
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Tree Adjoining Grammar (TAG) is a useful grammatical tool to model RNA secondary structures containing pseudoknots but its time complexity for parsing is not small enough for the practical use. Recently Weinberg and Ruzzo proposed a method of approximating stochastic context free grammar by stochastic regular grammar and applied it to faster genome annotation of non-coding RNA families. This paper proposes a method for extending their idea to stochastic approximation of TAGs by regular grammars. We will also report some preliminary experimental results on how well we can filter out non candidate parts of genome sequences by using obtained approximate regular grammars. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | Tree Adjoining Grammar (TAG) is a useful grammatical tool to model RNA secondary structures containing pseudoknots, but its time complexity for parsing is not small enough for the practical use. Recently, Weinberg and Ruzzo proposed a method of approximating stochastic context free grammar by stochastic regular grammar and applied it to faster genome annotation of non-coding RNA families. This paper proposes a method for extending their idea to stochastic approximation of TAGs by regular grammars. We will also report some preliminary experimental results on how well we can filter out non candidate parts of genome sequences by using obtained approximate regular grammars. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AA12177013 | |||||||
| 書誌情報 |
IPSJ Transactions on Bioinformatics （TBIO） 巻 48, 号 SIG17(TBIO3), p. 19-29, 発行日 2007-11-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-6679 | |||||||
| 出版者 | ||||||||
| 言語 | ja | |||||||
| 出版者 | 情報処理学会 | |||||||
