{"created":"2025-01-19T01:26:59.687780+00:00","updated":"2025-01-19T12:05:12.371544+00:00","metadata":{"_oai":{"id":"oai:ipsj.ixsq.nii.ac.jp:00227741","sets":["1164:1165:11326:11327"]},"path":["11327"],"owner":"44499","recid":"227741","title":["大規模DNAデータベースに対する高速な相関問合せ手法の提案"],"pubdate":{"attribute_name":"公開日","attribute_value":"2023-09-14"},"_buckets":{"deposit":"96c1085e-afe4-41a0-b45e-4a189a35e86d"},"_deposit":{"id":"227741","pid":{"type":"depid","value":"227741","revision_id":0},"owners":[44499],"status":"published","created_by":44499},"item_title":"大規模DNAデータベースに対する高速な相関問合せ手法の提案","author_link":["607091","607092","607093"],"item_titles":{"attribute_name":"タイトル","attribute_value_mlt":[{"subitem_title":"大規模DNAデータベースに対する高速な相関問合せ手法の提案"}]},"item_type_id":"4","publish_date":"2023-09-14","item_4_text_3":{"attribute_name":"著者所属","attribute_value_mlt":[{"subitem_text_value":"筑波大学理工情報生命学術院"},{"subitem_text_value":"筑波大学理工情報生命学術院"},{"subitem_text_value":"筑波大学計算科学研究センター"}]},"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/227741/files/IPSJ-DBS23177009.pdf","label":"IPSJ-DBS23177009.pdf"},"date":[{"dateType":"Available","dateValue":"2025-09-14"}],"format":"application/pdf","billing":["billing_file"],"filename":"IPSJ-DBS23177009.pdf","filesize":[{"value":"1.3 MB"}],"mimetype":"application/pdf","priceinfo":[{"tax":["include_tax"],"price":"660","billingrole":"5"},{"tax":["include_tax"],"price":"330","billingrole":"6"},{"tax":["include_tax"],"price":"0","billingrole":"13"},{"tax":["include_tax"],"price":"0","billingrole":"44"}],"accessrole":"open_date","version_id":"11aa925a-7f92-4226-a8c4-c320bb5923ed","displaytype":"detail","licensetype":"license_note","license_note":"Copyright (c) 2023 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":[{}]}]},"item_4_source_id_9":{"attribute_name":"書誌レコードID","attribute_value_mlt":[{"subitem_source_identifier":"AN10112482","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-871X","subitem_source_identifier_type":"ISSN"}]},"item_4_description_7":{"attribute_name":"論文抄録","attribute_value_mlt":[{"subitem_description":"DNA データベースに対する相関問合せとは，クエリとして DNA シーケンスが与えられたとき，クエリと共起して出現する部分構造を検索する方式であり，生命情報科学分野での応用が期待できる技術である．しかしながら，相関問合せでは DNA データベース内のすべてのシーケンスの部分構造が検索対象となるため，大規模な DNA データベースに対する相関問合せでは計算コストが大きくなる．本論文では DNA データベースを対象とした相関問合せの高速化手法を提案する．提案手法ではクエリとの相関値に着眼した閾値に基づく検索候補の枝刈り手法を導入する．相関値が低くなる部分構造を検索対象から除外することで，相関問合せの計算コストを削減する．本論文では実際の DNA データベースを用いた評価実験を行い，提案手法はベースライン手法と比較して高速かつ正確な相関問合せが可能であることを示した．","subitem_description_type":"Other"}]},"item_4_biblio_info_10":{"attribute_name":"書誌情報","attribute_value_mlt":[{"bibliographicPageEnd":"6","bibliographic_titles":[{"bibliographic_title":"研究報告データベースシステム（DBS）"}],"bibliographicPageStart":"1","bibliographicIssueDates":{"bibliographicIssueDate":"2023-09-14","bibliographicIssueDateType":"Issued"},"bibliographicIssueNumber":"9","bibliographicVolumeNumber":"2023-DBS-177"}]},"relation_version_is_last":true,"weko_creator_id":"44499"},"id":227741,"links":{}}