WEKO3
アイテム
完備辞書によるsnoRNA修飾領域の一次スクリーニング法
http://hdl.handle.net/10458/4742
http://hdl.handle.net/10458/474288ede76b-7f80-4d5e-8176-62c36edd6bef
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
engineering239-243.pdf (815.8 kB)
|
|
| Item type | 紀要論文 / Departmental Bulletin Paper(1) | |||||
|---|---|---|---|---|---|---|
| 公開日 | 2014-01-06 | |||||
| タイトル | ||||||
| タイトル | 完備辞書によるsnoRNA修飾領域の一次スクリーニング法 | |||||
| 言語 | ja | |||||
| タイトル | ||||||
| タイトル | A Screening Method to Extract snoRNA Modification Domain with Fully Indexable Dictionary | |||||
| 言語 | en | |||||
| 言語 | ||||||
| 言語 | jpn | |||||
| キーワード | ||||||
| 言語 | en | |||||
| 主題Scheme | Other | |||||
| 主題 | snoRNA, rRNA, trie, LOUDS, succinct data structure | |||||
| 資源タイプ | ||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||
| 資源タイプ | departmental bulletin paper | |||||
| その他（別言語等）のタイトル | ||||||
| その他のタイトル | カンビ ジショ ニヨル snoRNA シュウショク リョウイキ ノ イチジ スクリーニングホウ | |||||
| 言語 | ja-Kana | |||||
| 著者 |
山森, 一人
× 山森, 一人× 山本, 尭之× 相川, 勝× Yamamoto, Takayuki |
|||||
| 抄録 | ||||||
| 内容記述タイプ | Abstract | |||||
| 内容記述 | Small nucleolar RNA (snoRNA) is one of the non-coding RNAs exisiting in nucleolus of cells. SnoRNA is known that they will participate with RNA modifications such as methylation. Since the functions of snoRNAs in detail have not been known still yet, a new method is necessary to make clear the functions of snoRNA effectively. In particular, some researchers want to know where snoRNAs modify target RNAs. In this paper, we propose a screening method that extracts modification domain candidates on the target RNA based on the snoRNA sequence. A part of sequence makes a base pair structure between a snoRNA and a target RNA. Therefore complement of this part on snoRNA is similar to modification domain of target RNA. Our method finds the modification domain candidates by using Fully Indexable Dictionary (FID) built by complements of snoRNA sequences and snoRNA names. We use Trie with Level-Order Unary Degree Sequence (LOUDS) as FID. Trie is applied to full-text search, retrieving dictionary, and so on. LOUDS is a kind of succinct data structure, and it achieves low memory requirement and fast operation. However we have to concern to mutations and gaps in genomic searches with FID. If we allow unlimited number of mutations and gaps, it give us complete search in the dictionary. Therefore we give a mutation and a gap penalty, and terminate search process if the sum of penalty is more than a limit. Simulation results show that sensitivity, specificity and accuracy become 0.9 when maximum penalty is 2. | |||||
| 言語 | en | |||||
| 書誌情報 |
ja : 宮崎大学工学部紀要 en : Memoirs of Faculty of Engineering, University of Miyazaki 巻 42, p. 239-243, 発行日 2013-08-30 |
|||||
| 出版者 | ||||||
| 出版者 | 宮崎大学工学部 | |||||
| 言語 | ja | |||||
| 出版者 | ||||||
| 出版者 | Faculty of Engineering, University of Miyazaki | |||||
| 言語 | en | |||||
| ISSN | ||||||
| 収録物識別子タイプ | ISSN | |||||
| 収録物識別子 | 05404924 | |||||
| 書誌レコードID | ||||||
| 収録物識別子タイプ | NCID | |||||
| 収録物識別子 | AA00732558 | |||||
| 著者版フラグ | ||||||
| 出版タイプ | VoR | |||||
| 出版タイプResource | http://purl.org/coar/version/c_970fb48d4fbd8a85 | |||||
