{"created":"2025-01-19T00:19:56.823037+00:00","updated":"2025-01-20T18:57:15.545336+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00142502","sets":["1164:5352:8218:8281"]},"path":["8281"],"owner":"11","recid":"142502","title":["Repulsive Parallel MCMCアルゴリズムによる大規模塩基配列のモチーフ探索"],"pubdate":{"attribute_name":"公開日","attribute_value":"2015-06-16"},"_buckets":{"deposit":"81f38492-ae08-4bc6-9bec-d6a73cc03347"},"_deposit":{"id":"142502","pid":{"type":"depid","value":"142502","revision_id":0},"owners":[11],"status":"published","created_by":11},"item_title":"Repulsive Parallel MCMCアルゴリズムによる大規模塩基配列のモチーフ探索","author_link":["211732","211735","211733","211734"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"Repulsive Parallel MCMCアルゴリズムによる大規模塩基配列のモチーフ探索"},{"subitem_title":"Repulsive parallel MCMC algorithm for discovering diverse motifs from large sequence sets.","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2015-06-16","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"総合研究大学院大学統計科学専攻"},{"subitem_text_value":"総合研究大学院大学統計科学専攻／統計数理研究所"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Statistics, SOKENDAI","subitem_text_language":"en"},{"subitem_text_value":"Department of Statistics, SOKENDAI / The Institute of Statistical Mathematics","subitem_text_language":"en"}]},"item_language":{"attribute_name":"言語","attribute_value_mlt":[{"subitem_language":"jpn"}]},"item_publisher":{"attribute_name":"出版者","attribute_value_mlt":[{"subitem_publisher":"情報処理学会","subitem_publisher_language":"ja"}]},"publish_status":"0","weko_shared_id":-1,"item_file_price":{"attribute_name":"Billing file","attribute_type":"file","attribute_value_mlt":[{"url":{"url":"https://ipsj.ixsq.nii.ac.jp/record/142502/files/IPSJ-BIO15042033.pdf"},"date":[{"dateType":"Available","dateValue":"2100-01-01"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-BIO15042033.pdf","filesize":[{"value":"524.6 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"0","billingrole":"41"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"833d2eef-262f-4cb3-b6b9-0faea4ef7167","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2015 by the Institute of Electronics, Information and Communication Engineers This SIG report is only available to those in membership of the SIG."}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"他端, 久貴"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"吉田, 亮"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Hisaki, Ikebata","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"RyoYoshida","creatorNameLang":"en"}],"nameIdentifiers":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AA12055912","subitem_source_identifier_type":"NCID"}]},"item_4_textarea_12":{"attribute_name":"Notice","attribute_value_mlt":[{"subitem_textarea_value":"SIG Technical Reports are nonrefereed and hence may later appear in any journals, conferences, symposia, etc."}]},"item_resource_type":{"attribute_name":"資源タイプ","attribute_value_mlt":[{"resourceuri":"http://purl.org/coar/resource_type/c_18gh","resourcetype":"technical report"}]},"item_4_source_id_11":{"attribute_name":"ISSN","attribute_value_mlt":[{"subitem_source_identifier":"2188-8590","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"遺伝子発現の制御機構を理解する上で，転写因子結合部位 (TFBSs: transcription factor binding sites) を予測することは非常に重要である．TFBSs を構成する長さ 10 塩基ほどの塩基配列のパターンはモチーフと呼ばれる．近年のデータの大規模化により，高速の数え上げアルゴリズムが多く提案されているが，検出精度が十分とは言えない．本研究では，複数のモチーフを網羅的かつ効率良く列挙するための並列型マルコフ連鎖モンテカルロアルゴリズムを提案する．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"It is important to predict TFBSs (transcription factor binding sites) for the elucidation of the mechanism in gene regulation. TFBSs are consist of around 10-base-pair pattern, which are called motifs. Newly proposed algorithms for large datasets specialize in reducing the computation time. However they sacrifice the accuracy of motif detection because they use heuristics for speeding up. In our research, we propose parallel Markov chain Monte Carlo algorithm to obtain diverse motifs efficiently.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"5","bibliographic_titles":[{"bibliographic_title":"研究報告バイオ情報学（BIO）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2015-06-16","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"33","bibliographicVolumeNumber":"2015-BIO-42"}]},"relation_version_is_last":true,"weko_creator_id":"11"},"id":142502,"links":{}}