{"updated":"2025-01-19T15:41:15.662345+00:00","links":{},"created":"2025-01-19T01:17:25.776222+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00216918","sets":["1164:5352:10882:10883"]},"path":["10883"],"owner":"44499","recid":"216918","title":["結合エネルギーを考慮したゲノムワイドな高速短鎖核酸配列検索手法の開発"],"pubdate":{"attribute_name":"公開日","attribute_value":"2022-03-03"},"_buckets":{"deposit":"d7d27135-b8c9-4cae-89ca-d4bcf68af938"},"_deposit":{"id":"216918","pid":{"type":"depid","value":"216918","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"結合エネルギーを考慮したゲノムワイドな高速短鎖核酸配列検索手法の開発","author_link":["560944","560948","560946","560950","560949","560951","560953","560947","560945","560952","560954","560943"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"結合エネルギーを考慮したゲノムワイドな高速短鎖核酸配列検索手法の開発"},{"subitem_title":"Development of a Genome-wide Fast Short Nucleotide Sequence Search Method Considering Binding Energy","subitem_title_language":"en"}]},"item_type_id":"4","publish_date":"2022-03-03","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"東京工業大学情報理工学院情報工学系"},{"subitem_text_value":"東京工業大学情報理工学院情報工学系"},{"subitem_text_value":"株式会社情報数理バイオ"},{"subitem_text_value":"東京工業大学情報理工学院情報工学系"},{"subitem_text_value":"東京工業大学情報理工学院情報工学系"},{"subitem_text_value":"東京工業大学情報理工学院情報工学系"}]},"item_4_text_4":{"attribute_name":"著者所属(英)","attribute_value_mlt":[{"subitem_text_value":"Department of Computer Science, School of Computing, Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, School of Computing, Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"IMSBIO Co., Ltd.","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, School of Computing, Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, School of Computing, Tokyo Institute of Technology","subitem_text_language":"en"},{"subitem_text_value":"Department of Computer Science, School of Computing, Tokyo Institute of Technology","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/216918/files/IPSJ-BIO22069008.pdf","label":"IPSJ-BIO22069008.pdf"},"date":[{"dateType":"Available","dateValue":"2024-03-03"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-BIO22069008.pdf","filesize":[{"value":"953.1 kB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"41"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"990698cd-aa10-4855-8e09-df9121b4ea89","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2022 by the Information Processing Society of Japan"}]},"item_4_creator_5":{"attribute_name":"著者名","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"山崎, 眞拓"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"伊澤, 和輝"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"平田, 稜"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"柳澤, 渓甫"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"大上, 雅史"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"秋山, 泰"}],"nameIdentifiers":[{}]}]},"item_4_creator_6":{"attribute_name":"著者名(英)","attribute_type":"creator","attribute_value_mlt":[{"creatorNames":[{"creatorName":"Mahiro, Yamazaki","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Kazuki, Izawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Ryo, Hirata","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Keisuke, Yanagisawa","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Masahito, Ohue","creatorNameLang":"en"}],"nameIdentifiers":[{}]},{"creatorNames":[{"creatorName":"Yutaka, Akiyama","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":"核酸配列間における結合エネルギーは核酸同士の結合安定性を考慮する上で重要な要素である．さまざまな手法により結合エネルギーの計算が行われているが，一方の配列が短鎖であった場合に効率的かつ網羅的な計算を試みる手法は存在していない．本研究ではクエリ配列をアンチセンス(ASO)医薬品のギャップ領域として利用される長さである10塩基程度の短いものと想定し，結合エネルギーが強くなる配列を列挙しターゲット配列から検索する手法の提案，実装，性能比較を行なった．結果，クエリ配列長が10-14塩基のとき既存手法と比較して60-90倍の高速化に成功した．また，メモリ使用量についても1.4-116.6MBとなり，サーバ等の大規模な計算環境でなくても本手法が十分に実行可能であることを示した．","subitem_description_type":"Other"}]},"item_4_description_8":{"attribute_name":"論文抄録(英)","attribute_value_mlt":[{"subitem_description":"The binding energy between nucleic acid sequences is an important factor in considering the binding stability of nucleic acids. Although various methods exist, no method is dedicated for short sequences. The binding energy estimation of short sequences is needed to develop antisense oligonucleotide (ASO) drugs, which has a gap region of approximately 10 bases. In this study, we propose a method for short sequences that enumerate sequences and search through target sequences. We compared to RIsearch, a well-known tool, and the proposed method is 60-90 times faster than the previous tool when the query sequence length is 10-14 nucleotides. In addition, the amount of memory usage was 1.4-116.6MB, indicating that the proposed method can be implemented with a personal computer.","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"8","bibliographic_titles":[{"bibliographic_title":"研究報告バイオ情報学（BIO）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2022-03-03","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"8","bibliographicVolumeNumber":"2022-BIO-69"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":216918}